title: Implementing dijkstra's algorithm into windows form chart control
body: <p>I'm trying to implements a dijkstra's model of finding the shortest path of a connected graph.
  What I have is a graph that, upon hitting a button, randomly generates nodes on the graph.</p>
  
  <p>What I would like to do is the following:</p>
  
  <ol>
  <li>Determine if the graph is connected or not</li>
  <li>if connected, then decide 1 of three different ways of finding the shortest path:
  a. Shortest path by distance between start and end node
  b. Shortest path by number of edges
  c. Shortest path by total weight of edges (here, less weight is what we want...)</li>
  </ol>
  
  <p>Some other notes.</p>
  
  <p>Because these DataPoints are randomly generated in this chartcontrol, I don't actually have a Vertex class to generate the vertices.  I've been searching around and see that most path finding functions utilize a vertex class.  So basically my list is going to get populated from nodes off of the chart control.</p>
  
  <p>Could anyone provide any sort of insight in how I might go about solving the two above questions?</p>
  
  <pre><code>    //TODO:  Change to a function with return bool.  Void for purposes of testing at the moment.
      public void isConnected()
      {
  
          List&lt;DataPoint&gt; ParentPoints = new List&lt;DataPoint&gt;();
  
          //Gather all the non data generator into the same point array
          foreach (DataPoint pNonDG in chtGraph.Series[0].Points)
          {
              ParentPoints.Add(pNonDG);
          }
      }
  </code></pre>