At the moment, a shortest path traversal between two indices is implemented, which is handy. However, there is a generalization of this which is the shortest path to all other indices.
What's the best way to present this? A map of traversals?
This generalization should be applied for
- Unweighted edges (using Dijkstra)
- Positive weight edges (Dijkstra)
- Arbitrary weight edges (Bellman-Ford)
At the moment, a shortest path traversal between two indices is implemented, which is handy. However, there is a generalization of this which is the shortest path to all other indices.
What's the best way to present this? A map of traversals?
This generalization should be applied for