图(常见的用法).h（国外英文资料）.doc

图(常见的用法).h（国外英文资料） # # ifndef TU_H # define TU_H H # include queue. H # include stack. # include iostream Using namespace STD. / / typedef int DataType. The / / queue.h header file is already defined Pound sign define INT_MAX 9999 Typedef struct JuZhen { Int * index; DataType * val. / / dynamically assign the size of the adjacency matrix } JuZhen; / / class / / the depth, breadth, and topological sort of the diagram / / the shortest path algorithm for the web, Dijkstra, Floyd / / minimum spanning tree prim, kruskal Class Tu { Public: Tu (); Void ShenSou (); Void shensou (int); Void GuangSou (); Void TuoPuSort (); Void Floyd (); Void Dijkstra (); Void Prim (); Void Kruskal (); ~ Tu (); Private: JuZhen T; Int N; / / the number of the number of points is initialized in the constructor Int n; / / the number of edges Int choose; / / 1, which is shown in figure 2, not to figure 3, to network 4, not to the net }; Tu:, Tu () { Int I, j, k, weight; Cout Cin choose; The number of vertices in the cout ; Cin N. The number of edges of cout (undirected graph in half) : Cin n. (int *) calloc (N, sizeof (int)); / / callloc defaults to 0 malloc, which is a random number DataType * (DataType *) calloc (N * N, sizeof (DataType)); (k = 0;) / / the initial value INT_MAX means not negative or not? If (choose = = 1 | | choose = = 2) / / { Cout \ n; (k = 0; k n; k + +) { Cin I j; T.v. If (choose = = 2) T.v. } } If (choose = = 3 | | choose = = 4) / / net { Cout \ n ; / / memset (T.v, Infinite, N * N); This not line? (k = 0; k n; k + +) { Cin I , , weight; T.v. If (choose = = 4) T.v. } } } Tu: : ~ Tu () { Free (T.i ndex); / / be sure to release the space otherwise the computer is easy to get Free (T.v al); } Void Tu: : the depth of the deep preference search recursion function in shensou (int I) / / graph { Int j; (1) Cout For (j = 0; j N; j + +) { If (T.v.) { Shensou (j);/ / look for the way of recursion }