Description: Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (A). And calculate any distance between two nodes (B). Is not connected to the output of its various connectivity graph branch (C).
To Search:
File list (Check if you may need any files):
实验三完整程序.cpp
Download