title: Creating a undirected graph and traversing it using BFS in QuickGraph
body: <p>I'm trying to figure out how to create a new instance of a undirected weighted graph using QuickGraph for C#.  </p>
  
  <p>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.  </p>
  
  <p>There's not much to the documentation, so if anyone can provide any assistance that would be appreciated.</p>