Namespace AlgorithmsAndDataStructures.Algorithms.GraphTraversal

Classes

BFS

Implements Breadth First Search algorithm for graph traversal.

DFS

Implements Depth First Search algorithm for graph traversal.

Dijkstra

Implements Dijkstra's algorithm for finding shortest paths from a given node to all the other nodes in a graph.

GraphEdge<TValue>

A generic graph edge. For sample use-cases DFS, BFS, Dijkstra.

GraphNode<TValue>

A generic graph node. For sample use-cases DFS, BFS, Dijkstra.