The Floyd-Warshall algorithm is a method in computer science for finding the shortest paths between all pairs of vertices in a weighted graph. It works by considering, in turn, each vertex as a possible intermediate point on a path and updating the shortest known distance if the route through it is shorter. It can handle edges with negative weights, as long as there are no negative cycles, and runs in a time proportional to the cube of the number of vertices. The algorithm is named after Robert Floyd and Stephen Warshall, who published related versions in the early 1960s, and earlier work by Bernard Roy anticipated it. It is often presented as an example of dynamic programming.
Before and after
- 1 October 1958NASA is founded
- 8 October 1958Birth of Ursula von der Leyen
- 9 October 1958Death of Pius XII
- 23 December 1958Construction of Tokyo Tower
- 1959Invention of Floyd–Warshall algorithm
- 1959Construction of Ngorongoro Conservation Area
- 1959HIV/AIDS
- 1959Creation of ALGOL
- from 1959 to 1961Great Chinese Famine
More in Science & technology
- 1949Discovery of berkelium
- 1955Discovery of mendelevium
- 1958Discovery of nobelium
- c. 1980sInvention of laptop
- 9 November 1994Discovery of darmstadtium
- 8 December 1994Discovery of roentgenium
The era
This moment belongs to the Contemporary world (1945 CE to today), the world since 1945. You can also browse everything in the 20th century.