Method left

Graphs/dijkstra_algorithm.py:50–52

(self, i)

        return min_node

    def left(self, i):
        # returns the index of left child
        return 2 * i + 1

    def right(self, i):
        # returns the index of right child