graph.h

来自「实现无向图(或有向图)的存储表示,并输出对该图的广度优先（或深度优先）遍历。 」· C头文件 代码 · 共 60 行

// Graph.h: interface for the CGraph class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_GRAPH_H__5417E754_4D5D_4B3E_9C21_11475EFF5458__INCLUDED_)
#define AFX_GRAPH_H__5417E754_4D5D_4B3E_9C21_11475EFF5458__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

# define MAX_VERTEX_NUM 20
# define OK 1
typedef int VertexType;
typedef int InfoType;

typedef struct ArcNode		//define structure ALGraph
{  int adjvex;
   struct ArcNode *nextarc;
   InfoType info;
}ArcNode;//链式存储弧数据

typedef struct VNode
{  VertexType data;
   ArcNode *firstarc;
}VNode,AdjList[MAX_VERTEX_NUM];

typedef struct
{  AdjList vertices;
   int vexnum,arcnum;
   int kind;
}ALGraph;
typedef int QElemType;
typedef struct
{
	QElemType *base; 
    int front,rear; //对头对尾数据类型定义
}SqQueue; 

class CGraph  
{
public:
     ALGraph g;
public:
    int InitQueue(SqQueue &Q);
    int DeQueue(SqQueue &Q,QElemType &e);
	int QueueEmpty(SqQueue Q);
	int EnQueue(SqQueue &Q,QElemType e);
	void BFSTraverse(ALGraph G);
	void dispGriph(ALGraph G);
	void DFSTraverse(ALGraph G);
	void DFS(ALGraph G,int v,int *visited);
	int CreateDG(ALGraph &G);
    CGraph();
	virtual ~CGraph();

};

#endif // !defined(AFX_GRAPH_H__5417E754_4D5D_4B3E_9C21_11475EFF5458__INCLUDED_)