Lines Matching refs:shortest_path_length

88         assert nx.shortest_path_length(self.cycle, 0, 3) == 3
89         assert nx.shortest_path_length(self.grid, 1, 12) == 5
90         assert nx.shortest_path_length(self.directed_cycle, 0, 4) == 4
92         assert nx.shortest_path_length(self.cycle, 0, 3, weight="weight") == 3
93         assert nx.shortest_path_length(self.grid, 1, 12, weight="weight") == 5
94         assert nx.shortest_path_length(self.directed_cycle, 0, 4, weight="weight") == 4
97             nx.shortest_path_length(
103             nx.shortest_path_length(
109         pytest.raises(ValueError, nx.shortest_path_length, self.cycle, method="SPAM")
111         pytest.raises(nx.NodeNotFound, nx.shortest_path_length, self.cycle, 8)
115         sp = dict(nx.shortest_path_length(nx.path_graph(3), target=1))
118         sp = nx.shortest_path_length(nx.path_graph(3), target=1, weight="weight")
121         sp = nx.shortest_path_length(
125         sp = nx.shortest_path_length(
151         ans = dict(nx.shortest_path_length(self.cycle, 0))
154         ans = dict(nx.shortest_path_length(self.grid, 1))
157         ans = dict(nx.shortest_path_length(self.cycle, 0, weight="weight"))
160         ans = dict(nx.shortest_path_length(self.grid, 1, weight="weight"))
164             nx.shortest_path_length(self.cycle, 0, weight="weight", method="dijkstra")
169             nx.shortest_path_length(
197         ans = dict(nx.shortest_path_length(self.cycle))
200         ans = dict(nx.shortest_path_length(self.grid))
203         ans = dict(nx.shortest_path_length(self.cycle, weight="weight"))
206         ans = dict(nx.shortest_path_length(self.grid, weight="weight"))
210             nx.shortest_path_length(self.cycle, weight="weight", method="dijkstra")
215             nx.shortest_path_length(self.cycle, weight="weight", method="bellman-ford")