Namespace MoreStructures.Graphs.ShortestPath

Classes

BfsBasedShortestPathFinder

An implementation of IShortestPathFinder which performs a BFS traversal, starting from the start vertex, to find the shortest path to the end vertex.

Interfaces

IShortestPathFinder

An algorithm to find the shortest path (calculated as the number of edges forming the path) from a start vertex to an end vertex in a directed graph.