class QPanda::GraphDijkstra¶
Detailed Documentation¶
Solutions for Dijkstra algorithm.
Methods¶
Get the shortest path of the graph between begin with end.
Parameters:
| int | Begin: starting point |
| int | End: end point |
| std::vector<int>& | path_vec: The points at which the shortes path passes |
Returns:
int The length of the shortes path
Determine if the graph is connected.
Returns:
bool Result of the judgement
See also: