mic openmp 求dijkstra

最新推荐文章于 2023-06-17 18:07:10 发布

yet

最新推荐文章于 2023-06-17 18:07:10 发布

阅读量800

点赞数

本文链接：https://blog.csdn.net/u010286868/article/details/46674599

版权

该博客展示了如何使用OpenMP进行并行计算，实现Dijkstra最短路径算法。通过读取输入文件构建图，利用邻接表存储图结构，并初始化消息队列，接着在多个线程中迭代更新最短路径。最终，程序会输出迭代次数和计算所用时间。

摘要由CSDN通过智能技术生成

</pre><pre name="code" class="cpp">#include <stdio.h>
#include <iostream>
#include <memory.h>
#include <omp.h>

using namespace std;

#define NODENUM 264346
#define MAXNODENUM 1000000
#define MAXEDGENUM 4000000
#define THREADNUM 64
#define MAXINPUTLINE 512
#define s 0 // source

// Graph info
int f[MAXNODENUM]; // Distance to source
int route[MAXNODENUM]; //route store the route
int edge_l[MAXEDGENUM], edge_r[MAXEDGENUM], edge_dis[MAXEDGENUM]; // An edge's left and right endtime, and its distance
int ad_next[MAXEDGENUM], ad_head[MAXNODENUM]; // Use adjacency list to store graph. For each point, use a list to store its adjacent edges table.
//ad_head is the list's first element(edge id), ad_next is each element(edge id)'s next pointer.

int edge_cnt = 0; // Number of edges

// Computation share memory
int msg_head[2][THREADNUM][THREADNUM], msg_next[2][MAXEDGENUM]; // Use a list to