Description: Classic examples of data structures in order to free the adjacency table to store multiple undirected graph. Followed by a few even in the form of a string of data input from the keyboard. Such as: (A, B) from the initial node (the data field of the value of an uppercase letter A), to the end node (the data field of the value of an uppercase letter B), without the side . Last input (Z, Z) represents the input end.
To Search:
File list (Check if you may need any files):
实习题\5070309538_4.dsp
......\5070309538_4.dsw
......\5070309538_4.ncb
......\5070309538_4.opt
......\5070309538_4.plg
......\Graph.h
......\main.cpp
实习题
Download