链式前向星储存

最新推荐文章于 2025-06-02 23:42:13 发布

原创最新推荐文章于 2025-06-02 23:42:13 发布 · 874 阅读

0 ·

CC 4.0 BY-SA版权

[Graph Theory] 专栏收录该内容

38 篇文章

订阅专栏

本文介绍了使用C++语言实现图论算法，具体包括构建有向图和展示图中从起点到终点的路径。通过实例代码展示了如何使用邻接表来表示图，并实现了一种简单的遍历算法来找到所有可能的路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <cstring>
using namespace std;

#define E 10000
#define V 100

struct Edge{

    int to_node;
    int edge_val;
    int next_edge;

    Edge(){}
    Edge( int to, int val, int next ){
        to_node   = to;
        edge_val  = val;
        next_edge = next;
    }
};

Edge edges[E];
int heads[V];

int nEdgeNum, nNodeNum;
int nEdgeCount;


void addEdge( int from, int to, int dist ){

    edges[nEdgeCount].to_node   = to;
    edges[nEdgeCount].edge_val  = dist;
    edges[nEdgeCount].next_edge = heads[from];
    heads[from]                 = nEdgeCount;

    nEdgeCount++;

}


void showGraph(){
    for( int i = 1; i <= nNodeNum; ++i ){

        cout << i;

        for( int j = heads[i]; ~j; j = edges[j].next_edge ){
            cout << "-->" << edges[j].to_node << "(" << edges[j].edge_val << ")";
        }
        
        cout << "-->NULL" << endl;
        
    }
}


int main(){

    int from, to, dist;

    while( cin >> nNodeNum >> nEdgeNum ){

        memset( heads, -1, sizeof( heads ) );

        for( int i = 1; i <= nEdgeNum; ++i ){

            cin >> from >> to >> dist;

            addEdge( from, to, dist );

        }

        showGraph();

    }

    return 0;
}