It is an all-or-nothing algorithm for traffic assignment.
Given a network with limited links and demand between each node pair, calculate the traffic flow on each link based on all-or-nothing assignement algorithm, e.g. assign all the traffic demand from node 1 to 3 to its shortest path.
Input files:
- network.csv (arrange it in such an order from top to bottom: 1 - 2, 1 - 3, ..., 1 - N, 2 - 3, 2 - 4 ..., (N-1) - N)
- OD.csv (traffic demand on each origin - destination pair)
The Dijsktra algorithm on finding the shortest path is credited to dingran.