Minimum mean less edge can not be less, then less would not be able to connect together.
No spanning tree directed graph
How to use the configured minimum spanning tree MST, MST algorithm is a greedy algorithm.
Note that the process does not produce selected circuit, because every time point in the minimum spanning tree, the connection process is not the minimum point on the generated book. ,
Non-unique minimum spanning tree.
The shortest path problem
A plurality of paths which reaches the point B (the end) to the network point A (point source), the path to find the minimum value of the edge weights and a sum, i.e. the shortest path.
The shortest path different from the minimum spanning tree is not necessarily on a path comprises n vertices, it does not necessarily contain n-1 edges.
The shortest path from the starting point to the end point.
Dijistra algorithm is used to find starting from a vertex, each vertex to the shortest path, the shortest path can also be used from one to another vertex to vertex,
