(1) coding structure and undirected graph adjacency matrix storage network creation, traverse the main operations, such as
(2) in view of the adjacency matrix representation of the undirected network, listed in the following problems to solve at least choose:
(1) she algorithm or kruskal algorithm is used to design and implement the minimum spanning tree problem solving;
(2) using the dijkstra or Floyd algorithm, design and realize the shortest path problem solving,
(3) for solving the problem, write a test program, and select the appropriate test data, by running the results verify the correctness of the algorithm and program design,

CodePudding user response:

The problem for you I the learning data structure is a bit harder

CodePudding user response:

School to do real class, not -_ - | |

CodePudding user response:

I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10581430.html
I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10768339.html