I'm trying to figure out how to create a new instance of a undirected weighted graph using QuickGraph for C#.
My goal is to create a undirected weighted graph populated with a random number of nodes and randomly generated start and finish nodes whose shortest path can found using Breadth-First Search algorithm.
There's not much to the documentation, so if anyone can provide any assistance that would be appreciated.
There's no documentation for this algorithm yet; but there's the next best thing (or perhaps even a better thing): a Unit Test!
If you download the QuickGraph sources, and find the
BreadthFirstAlgorithmSearchTest.BreadthFirstSearchAll()
, you will see an example usage of the algorithm which runs BFS on all the directed graphs in the test project.