# Algorithm 97: Shortest path

@article{Floyd1962Algorithm9S, title={Algorithm 97: Shortest path}, author={Robert W. Floyd}, journal={Communications of the ACM}, year={1962}, volume={5}, pages={345} }

procedure ari thmetic (a, b, c, op); in t eger a, b, c, op; ¢ o n l m e n t This procedure will perform different order ar i thmetic operations with b and c, put t ing the result in a. The order of the operation is given by op. For op = 1 addit ion is performed. For op = 2 multiplicaLion, repeated addition, is done. Beyond these the operations are non-commutat ive. For op = 3 exponentiat ion, repeated multiplication, is done, raising b to the power c. Beyond these the question of grouping is…

## 3,628 Citations

(Machine) Learning to Improve the Empirical Performance of Discrete Algorithms

- Computer ScienceArXiv
- 2021

A data-driven, empirically-based framework to make algorithmic decisions or recommendations without expert knowledge is discussed, which recommends various pivot rules that improve overall total performance over just using a fixed default pivot rule.

Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers

- Computer ScienceCGO
- 2020

A novel framework to automatically derive highly efficient parametric multi-way recursive divide&conquer algorithms for a class of dynamic programming (DP) problems where the value of R can be changed on the fly for every level of recursion.

D2P: from recursive formulations to distributed-memory codes

- Computer ScienceSC
- 2019

D2P is presented, a system that automatically generates distributed-memory codes for recursive divide-conquer algorithms with certain properties, and the generated implementations are scalable and efficient.

Incrementally closing octagons

- Computer ScienceFormal Methods Syst. Des.
- 2019

This work presents new quadratic incremental algorithms for closure, strong closure and integer closure and proofs of their correctness and highlights the benefits and measure the performance of these new algorithms.

Low-Complexity Encryption Algorithm Considering Energy Balance on Wireless Sensor Networks

- Computer Science2019 International Conference on Advanced Computing and Applications (ACOMP)
- 2019

The proposed key management method improves the security level of data by increasing the number of keys with a simple algorithm in WSNs and obtains more balances in energy consumption compared to the centralization model.

10-31-2018 D 2 P : Automatically Creating Distributed Dynamic Programming Codes

- Computer Science
- 2018

D2P is presented, an end-to-end system for automatically transforming a specification of any recursive DP algorithm into distributed-memory implementation of the algorithm, which automatically generates the corresponding MPI-based implementation.

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components

- Computer ScienceACM Trans. Program. Lang. Syst.
- 2018

Algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring are studied, and algorithms that significantly improve the worst-case running time of the traditional approach and various tradeoffs depending on the number of queries are provided.

Disciples of the Heinous Path: Social network structure and genre hierarchy in Heavy Metal

- Computer Science
- 2018

An extensive data-set from Encyclopaedia Metallum, a Heavy Metal band archive, was used to test the hypothesis whether or not the social network structure is influenced by a hierarchy of genres, and results remain inconclusive.

The Schulze Method of Voting

- MathematicsArXiv
- 2018

A new single-winner election method ("Schulze method") is proposed and it is proved that it satisfies many academic criteria and a generalization of the Condorcet criterion to multi-winner elections is proposed.

Metaheuristics for designing efficient routes & schedules for urban transportation networks

- Business, Computer Science
- 2016

This thesis tackles the Urban Transit Network Design Problem (UTNDP) which involves determining an efficient set of routes and schedules for public transit networks and demonstrates that a MOEA based on the NSGAII framework provides the best quality solutions due to the cost of evaluation when using a neighbourhood based approach such as multi-objective tabu search.

## References

SHOWING 1-3 OF 3 REFERENCES

AA: d := 2Tn; h := (b -a)/4/d; g[1] := f(a + h X (4 X m + 1)); g[3] := f(a + h X (4 X m + 3)); All

- AA: d := 2Tn; h := (b -a)/4/d; g[1] := f(a + h X (4 X m + 1)); g[3] := f(a + h X (4 X m + 3)); All

AVINT was transliterated into BAC-220 (a dialect of ALGOL-58) and was tested on the Burroughs 220 computer. The following minor errors were found

- AVINT was transliterated into BAC-220 (a dialect of ALGOL-58) and was tested on the Burroughs 220 computer. The following minor errors were found

The first statement following label Lll should read: dif := 2 X a X xarg A-b; 2. The semicolon (;) at the end of the line beginning with the label L16 should be deleted

- The first statement following label Lll should read: dif := 2 X a X xarg A-b; 2. The semicolon (;) at the end of the line beginning with the label L16 should be deleted