Graph Traversals in C++ and C#
Breadth First SearchFrom WikiPedia:“Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a …
Tag: Depth first search
Using depth first search to test graph connectivity in C++
Problem descriptionGiven a directed or undirected graph, determine whether it is connected or not. Specifically is it possible for any pair of nodes to communicate with each other?This brief post …
A Recursive Algorithm to Find all Paths Between Two Given Nodes in C++ and C#
Problem OutlineThis I tackled previously when working on the design and implementation of routing optimization algorithms for telecommunications networks. Given that a wide area network with nodes and interconnecting links …