(self, N = 0)
| 3 | class Graph: |
| 4 | |
| 5 | def __init__(self, N = 0): # a graph with Node 0,1,...,N-1 |
| 6 | self.N = N |
| 7 | self.W = [[math.inf for j in range(0,N)] for i in range(0,N)] # adjacency matrix for weight |
| 8 | self.dp = [[math.inf for j in range(0,N)] for i in range(0,N)] # dp[i][j] stores minimum distance from i to j |
| 9 | |
| 10 | def addEdge(self, u, v, w): |
| 11 | self.dp[u][v] = w |
nothing calls this directly
no outgoing calls
no test coverage detected