Namespace MoreStructures.Graphs.ShortestDistanceTree

Classes

BellmanFordShortestDistanceTreeFinder

A IShortestDistanceFinder implementation based on the Bellman-Ford algorithm.

DijkstraShortestDistanceTreeFinder

A IShortestDistanceTreeFinder implementation based on the Dijkstra algorithm.

Interfaces

IShortestDistanceTreeFinder

An algorithm that, given a start vertex on a weighted directed graph, finds the shortest distance from the start to any other vertex in the graph, and a path for each vertex of the graph having such a total distance.