title: dijkstra's algorithm with shortest path
body: <p>Can Someone help me or point me in the right direction im just lost i dont know what they mean set values to infinity are they talking about the edges? or is this a new variable that each node has.Some advice or some help being pointed in the right direction would be appreciated. Heres what i have so far (though its garbage in my opinion)</p>
  
  <pre><code>def dijkstra(self, start):
  
      print("end dijkstra")
      for node in self.__nodes:
              curr_node = 0
              for node in self.__nodes:
                  distances = float('inf')
                  before_node = None
  
                  print(node)
  
      """
      try:
  
  
          #for node in weighted_digraph:
              #distances[node] = float('inf')
              #predecessors[node] = None
              print("work")
              print(node)
              #print(weighted_digraph)
          #sp_set = []
          #distances[start] = 0
      except TypeError:
          print("BS OCCURED")
      """
  </code></pre>