Method show_graph

Graphs/dijkstra_algorithm.py:103–107

(self)

            self.adjList[v] = [(u, w)]

    def show_graph(self):
        # u -> v(w)
        for u in self.adjList:
            print(u, '->', ' -> '.join(str("{}({})".format(v, w))
                                       for v, w in self.adjList[u]))

    def dijkstra(self, src):
        # Flush old junk values in par[]