邻接表宽搜深搜

#include <iostream>
using namespace std;

const int MaxVertexNum=100;
typedef int Vertex;
typedef int WeightType;
typedef char DataType;

typedef struct ENode * PtrToENode;
typedef PtrToENode Edge;
struct ENode
{
    Vertex V1,V2;
    WeightType Weight;
};

typedef struct AdjVNode *PtrToAdjVNode;
struct AdjVNode
{
    Vertex AdjV;
    WeightType Weight;
    PtrToAdjVNode Next;
};

typedef struct Vnode
{
    PtrToAdjVNode FirstEdge;
    DataType Data;
}AdjList[MaxVertexNum];

typedef struct GNode *PtrToGNode;
struct GNode
{
    int Nv;
    int Ne;
    AdjList G;
};
typedef PtrToGNode LGraph;



LGraph CreateGraph(int VertexNum)
{
    Vertex V;
    LGraph Graph;
    Graph=(LGraph)malloc(sizeof(struct GNode));
    Graph->Nv=VertexNum;
    Graph->Ne=0;
    for(V=0;V<Graph->Nv;V++)
    {
        Graph->G[V].FirstEdge=NULL;
    }
    return 0;
}

void InsertEdge(LGraph Graph ,Edge E)
{
    PtrToAdjVNode NewNode;
    NewNode=(PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
    NewNode->AdjV=E->V2;
    NewNode->Weight=E->Weight;
    NewNode->Next=Graph->G[E->V1].FirstEdge;
    Graph->G[E->V1].FirstEdge=NewNode;
}



int main()
{

    return 0;
}
邻接表是一种图的存储结构,它可以用于实现图的度优先索(DFS)和广度优先索(BFS)。下面是邻接表和广的C语言实现: 1. 邻接表度优先索(DFS)C语言实现: ```c #define MAXNODE 1000 #define MAXSIDE 10000 typedef struct SIDE { int tailNode; int nextSide; int weight; } SIDE; SIDE edge[MAXSIDE]; int head[MAXNODE]; int visited[MAXNODE]; int counttEdge = 0; void CreateABoundary(int headNode, int tailNode, int weight) { edge[counttEdge].tailNode = tailNode; edge[counttEdge].weight = weight; edge[counttEdge].nextSide = head[headNode]; head[headNode] = counttEdge; counttEdge++; } void DFS(int node) { visited[node] = 1; printf("%d ", node); for (int i = head[node]; i != -1; i = edge[i].nextSide) { int nextNode = edge[i].tailNode; if (!visited[nextNode]) { DFS(nextNode); } } } int main() { // 初始化 memset(head, -1, sizeof(head)); memset(visited, 0, sizeof(visited)); counttEdge = 0; // 创建图 CreateABoundary(1, 2, 0); CreateABoundary(1, 3, 0); CreateABoundary(2, 4, 0); CreateABoundary(2, 5, 0); CreateABoundary(3, 6, 0); CreateABoundary(3, 7, 0); // DFS遍历 DFS(1); return 0; } ``` 2. 邻接表的广度优先索(BFS)C语言实现: ```c #define MAXNODE 1000 #define MAXSIDE 10000 typedef struct SIDE { int tailNode; int nextSide; int weight; } SIDE; SIDE edge[MAXSIDE]; int head[MAXNODE]; int visited[MAXNODE];int counttEdge = 0; void CreateABoundary(int headNode, int tailNode, int weight) { edge[counttEdge].tailNode = tailNode; edge[counttEdge].weight = weight; edge[counttEdge].nextSide = head[headNode]; head[headNode] = counttEdge; counttEdge++; } void BFS(int node) { int queue[MAXNODE]; int front = 0, rear = 0; visited[node] = 1; printf("%d ", node); queue[rear++] = node; while (front < rear) { int curNode = queue[front++]; for (int i = head[curNode]; i != -1; i = edge[i].nextSide) { int nextNode = edge[i].tailNode; if (!visited[nextNode]) { visited[nextNode] = 1; printf("%d ", nextNode); queue[rear++] = nextNode; } } } } int main() { // 初始化 memset(head, -1, sizeof(head)); memset(visited, 0, sizeof(visited)); counttEdge = 0; // 创建图 CreateABoundary(1, 2, 0); CreateABoundary(1, 3, 0); CreateABoundary(2, 4, 0); CreateABoundary(2, 5, 0); CreateABoundary(3, 6, 0); CreateABoundary(3, 7, 0); // BFS遍历 BFS(1); return 0; } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值