数据结构 公交线路换乘（国外英文资料）.docVIP

数据结构 公交线路换乘（国外英文资料） # include fstream.h / file library # include stdlib. H # include string.h / / string function library Const int Maxbus = 100; / / the maximum number of buses Const int Maxstate = 200; / / maximum number of sites Const int MaxValue = 999; / / Max A struct Bus / / Bus class { Int number; / / bus number Int length; / / terminal number Char bus_state [Maxstate] [20]; / / site }; Class Graph / / create a non-directed Graph { Friend class short; / / declare friends class Private: Char statename [Maxstate] / / site Int busnumber [Maxstate]; / / adjacency matrix, which is the bus number of these two stations Int currentstate; / / current site number Int currentbus; / / the current number of buses Bus buses [Maxbus]; / / bus information Public: Graph () / / no parametric constructor, initializing member variables { For (int I = 0; I Maxstate; I + +) For (int j = 0; j Maxstate; j + +) { If (I = = j) Busnumber [j] = -1; / / you dont have a car yourself The else Busnumber [I] = MaxValue; } Currentstate = 0; / / site number is initialized to 0 Currentbus = 0; / / bus number is initialized to 0 For (I = 0; I Maxbus; I + +) { Buses [I]. Buses [I]. Length = 0; } } Void Insertstate (char state []) / / inserts a site { If (! IsGraphFull ()) / / if the graph is not full { For (int I = 0; I currentstate; I + +) / / see if the station already exists If (state, statename [I] = = 0) Break; If (I = = currentstate) / / if not, add it after the site array { Statename [currentstate], state; For (I = 0; I currentstate; I + +) { Busnumber [I] = MaxValue; Busnumber [I] [currentstate] = MaxValue; } Busnumber [currentstate] [currentstate] = -1; Currentstate++; / / the current array adds one } } } Void Insertbusnumber (char V1 [], char V2 [], int busnum) / / insert weight { For (int I = 0; I currentstate; I + +) / / find the site If (V1, statename [I] = = 0) Break; For (int j = 0; j currentstate; j + +) If (the STRCMP (V2, statename [j]) = = 0) Break; There is an in