#include<stdio.h>
#include<stdlib.h>
//--------------------------------------------------------
//定义边
struct Enode
{
int v1,v2;
int weight;
};
typedef struct Enode *Edge;
//定义邻接点
struct Gnode
{
int Adjx;
struct Gnode *next;
};
//定义图的头结点
struct HeadNode
{
int Data;
struct Gnode *next;
};
//-----------------------------------------------------------
//------------------------------------------------------------
typedef struct CreateGraph
{
int Nv,Ne;
struct HeadNode *GL;
} *Graph;
//不单独使用,放进去MdaeGraph里面用
Graph BuildGraph(int Nv,int Ne,Graph G)
{
G->Ne=Ne;
G->Nv=Nv;
G->GL=(struct HeadNode*)malloc(sizeof(struct HeadNode)*Nv);
int i;
for(i=0;i<Nv;i++)
{
G->GL[i].next=NULL;
}
printf("已成功为头节点分配NULL值\n");
return G;
}
//不单独使用,放进去MdaeGraph里面用
void InsertGraph(Graph G,Edge E)
{
struct Gnode *NewNode;
NewNode=(struct Gnode*)malloc(sizeof(struct Gnode));
NewNode->Adjx=E->v2;
NewN
C语言邻接表的深度优先遍历
最新推荐文章于 2023-12-11 07:20:51 发布