News
The FPGA runs an algorithm for finding the shortest route between two points, called Dijkstra’s algorithm.
Project Scheduling in And-Or Graphs: A Generalization of Dijkstra's Algorithm George M. Adelson-Velsky and Eugene Levner Mathematics of Operations Research , pp. 504-517 (14 pages) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback