Method add_edge

dynamic_programming/floyd_warshall.py:14–24

Adds a directed edge from node u to node v with weight w. >>> g = Graph(3) >>> g.add_edge(0, 1, 5) >>> g.dp[0][1] 5

(self, u, v, w)

        ]  # dp[i][j] stores minimum distance from i to j

    def add_edge(self, u, v, w):
        """
        Adds a directed edge from node u
        to node v with weight w.

        >>> g = Graph(3)
        >>> g.add_edge(0, 1, 5)
        >>> g.dp[0][1]
        5
        """
        self.dp[u][v] = w

    def floyd_warshall(self):
        """