Description: Using c language data structure used to establish the adjacency table thought the storage structure, free of the graph depth-first traversal and breadth-first traversal. User-specified vertex as a starting point, the output of each traverse were the culmination of access under the sequence. The vertex set of not more than 30, with a number that each vertex (if a graph has N vertices, then their numbers were 1,2, ..., N). By entering the graph all edges entering a graph, each edge two vertices numbers right, vertices can be numbered on the side of attachment to restrict input sequence (for example, from small to large).
To Search:
File list (Check if you may need any files):
实验五 程序1\Debug\graphap.obj
............\.....\main.obj
............\.....\traver.exe
............\.....\traver.ilk
............\.....\traver.opt
............\.....\traver.pch
............\.....\traver.pdb
............\.....\vc60.idb
............\.....\vc60.pdb
............\graph.h
............\graphap.cpp
............\main.cpp
............\traver.dsp
............\traver.dsw
............\traver.ncb
............\traver.opt
............\traver.plg
............\Debug
实验五 程序1
Download