java_oracle_c的专栏

此图是以图的邻接表法作为储存方式，对图进行深度优先搜索和广度优先搜索（均是非递归） # include # include # define True 1 # define False 0 # define Error -1 # define OK 1 # define MAX_VERTEX_NUM 20 int visited[MAX_VERTEX_NUM]; typede

# include # define MAX_VERTEX_NUM 20 # define INFINITY 32768 # define Error -1 # define OK 1 typedef int AdjType; typedef enum{DG,DN, UDG,UDN} GraphKind; typedef char VertexData; struct {