Commit

added download link

Browse files

Loading branch information

anvit25 committed Apr 26, 2021

1 parent a9010f1 commit b9a592c

README.md

Johnson's APSP

The executable can be downloaded here

This is a simple implementation of Johnson's All Pair Shortest Path algorithm. Dijkstra's algorithm is implemented using a Binary Heap. The time complexity of this implementation is O(VE logV)

The application reads input from "input.txt" and writes output to "output.csv".

WARNING: If "output.csv" already exists in the current directory, it will be deleted.

The format of the input is as following :-

V=3, E=3
1: (2,3), (3,-1)
3: (1,4)

This represents a graph with three edges and three vertices. The program assumes that the edges are named 1,2,...,n . Here, we have three edges, from 1 to 2 with weight 3, from 1 to 3 with weight -1 and from 3 to 1 with weight 4. Note that there is no outgoing edge from 2. Note that the bracket, commas and colons are not needed. The following is also a valid input file

3 3
1 2 3 3 -1
3 1 4

The output for the above input will be

0,3,-1
inf,0,inf
4,7,0

The output is a V x V matrix with all the required lengths.

Binary file not shown.

target/release/johnson.exe

Binary file not shown.

0 comments on commit `b9a592c`

Please sign in to comment.