In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path Between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標簽： optimizing different the shortest
上傳時間： 2014-10-25
上傳用戶：1159797854
Fortran 90 versions of all the Numerical Recipes routines appear in the following Chapters B1 through B20, numbered in correspondence with Chapters 1 through 20 in Volume 1. Within each chapter, the routines appear in the same order as in Volume 1, but not broken out separately by section number within Volume 1鈥檚 chapters. There are commentaries accompanying many of the routines, generally following the printed listing of the routine to which they apply. These are of two kinds: issues related to parallelizing the algorithm in question, and issues related to the Fortran 90 implementation. To distinguish Between these two, rather different, kind
標簽： Numerical following the Chapters
上傳時間： 2017-04-12
上傳用戶：6546544
The paper describes the concept and realization of the DOOCS control software for FPGAbased TESLA cavity controller and simulator (SIMCON). It bases on universal software components, created for laboratory purposes and used in MATLAB based control environment. These modules have been recently adapted to the DOOCS environment to ensure a unified software to hardware communication model. The presented solution can be also used as a general platform for control algorithms development. The proposed interfaces Between MATLAB and DOOCS modules allow to check the developed algorithm in the operation environment before implementation in the FPGA. As the examples two systems have been presented.
標簽： realization FPGAbased describes the
上傳時間： 2017-04-16
上傳用戶：koulian
A Java class representation of a fuzzy cognitive map which contains a set of factors and relationships Between them.
標簽： representation relationsh cognitive contains
上傳時間： 2014-01-03
上傳用戶：努力努力再努力
This a simple program for change the background you can insert UR cotent at <body>.....UR document...</body> Between this tags
標簽： background program simple change
上傳時間： 2017-04-23
上傳用戶：gaojiao1999
The aip file contains few Matlab routines for 1D line scan analysis, 1D scaling, 2D scaling, image brightness or contrast variation routine and rouitne for finding area Between zero cossings of 1D times series.
標簽： scaling contains analysis routines
上傳時間： 2014-01-19
上傳用戶：xmsmh
If a tree falls in the forest, and there s nobody there to hear, does it make a sound? This classic conundrum was coined by George Berkeley (1685-1753), the Bishop and influential Irish philosopher whose primary philosophical achievement is the advancement of what has come to be called subjective idealism. He wrote a number of works, of which the most widely-read are Treatise Concerning the Principles of Human Knowledge (1710) and Three Dialogues Between Hylas and Philonous (1713) (Philonous, the "lover of the mind," representing Berkeley himself).
標簽： there classic forest nobody
上傳時間： 2013-11-26
上傳用戶：stvnash
This is a mutlicore and cluster(of single-core,multi-core systems) matrix inversion code. Which uses the MPI(Message Passing Interface) for communication across the compute nodes of cluster and using thread-API based OpenMP(Open Multi Processing) Between cores of intra-compute or head node.
標簽： single-core multi-core inversion mutlicore
上傳時間： 2013-12-21
上傳用戶：ryb
In the last decade the processing of polygonal meshes has emerged as an active and very productive research area. This can basically be attributed to two developments: Modern geometry acquisition devices, like laser scanners and MRT, easily produce raw polygonal meshes of ever growing complexity Downstream applications like analysis tools (medical imaging), computer aided manufacturing, or numerical simulations all require high quality polygonal meshes as input. The need to bridge the gap Between raw triangle soup data and high-quality polygon meshes has driven the research on ecient data structures and algorithms that directly operate on polygonal meshes rather than on a (most often not feasible) intermediate CAD representation.
標簽： processing productive the polygonal
上傳時間： 2017-06-03
上傳用戶：TF2015
SOME BACKGROUND ON DESIGN PATTERNS The term “design patterns” sounds a bit formal to the uninitiated and can be somewhat off-putting when you first encounter it. But, in fact, design patterns are just convenient ways of reusing object-oriented code Between projects and Between programmers. The idea behind design patterns is simple-- write down and catalog common interactions Between objects that programmers have frequently found useful.
標簽： BACKGROUND uninitiate PATTERNS patterns
上傳時間： 2013-12-22
上傳用戶：shizhanincc
