链式向前星-代码记录

最新推荐文章于 2024-03-26 13:30:22 发布

方书山

最新推荐文章于 2024-03-26 13:30:22 发布

阅读量78

点赞数

分类专栏：算法 C

本文链接：https://blog.csdn.net/aXinlei/article/details/126200786

版权

图数据结构邻接表 C++编程遍历算法图论

关键词由CSDN通过智能技术生成

算法同时被 2 个专栏收录

10 篇文章 0 订阅

订阅专栏

3 篇文章 0 订阅

订阅专栏

#include <iostream>
using namespace std;
struct node{
    int to;
    int next;
    int w;
}edge[50*50];
int head[50];
int main(){
  int n,m;
  cout <<"Input node size:";
  cin >> n;
  cout << "Input edge size:";
  cin >> m;
  int edge_count = 0;
  for (int i = 0; i < n; i++)
  {
    head[i] = -1;
  }

  for (int i = 0; i < m; i++)
  {
    int starts,to_,w;
    cout << "start node ,to node, w :";
    cin >> starts >> to_ >> w;
    edge[edge_count].to = to_;
    edge[edge_count].w = w;
    edge[edge_count].next = head[starts];
    head[starts] = edge_count;
    edge_count++;
  }
  for (int i = 0; i < n; i++)
  {
    cout << "node:"<<i << endl;
    int j = head[i];
    while (j!=-1)
    {
        cout << edge[j].to << " w:" << edge[j].w << endl;
        j = edge[j].next;
    }
    cout <<"----the end ----" << endl;
  }
  
  
  
}