Description: The campus LAN wiring and traveled tasks: undirected said your school floor plan, said the main building of vertices and edges in the graph represents a road between the buildings, storage path length information. Requires the ability to create a campus LAN spent minimal cost given traveled the shortest path between any building. Basic requirements: (1) the original data file, easy read (2) buildings not less than 20 points, the edge is not less than 30 (3), respectively, with the breadth-first and depth-first traversal Figure as a starting point for the 1st teaching building (4) to establish a campus LAN, least costly requirements of the flower (5) query teaching from the 1st floor to the other points of the shortest path (6) any two buildings in the query graph The shortest path between.
To Search:
File list (Check if you may need any files):
3\3.1.h
.\3.2.h
.\3.cpp
.\books.txt
.\Debug\3.obj
.\.....\vc60.idb
.\.....\vc60.pdb
.\.....\校园局域网布线和游历问题.exe
.\.....\校园局域网布线和游历问题.ilk
.\.....\校园局域网布线和游历问题.pch
.\.....\校园局域网布线和游历问题.pdb
.\校园局域网布线和游历问题.dsp
.\校园局域网布线和游历问题.dsw
.\校园局域网布线和游历问题.ncb
.\校园局域网布线和游历问题.opt
.\校园局域网布线和游历问题.plg
.\Debug
3
Download