发现了虫子,求助。急!# Living
B*1
1 楼
Main Question:
Design a parallel Breadth First Search algorithm for a directed weighted
graph.
Basically you need to find the minimum cost to reach to a node from the
starting node. (Just save the optimum cost and not the optimum path)
. Calculate and output the optimum reachability cost for all the nodes from
a given starting point.
Implement in C with openMP.
1. How about using DFS or Shortest path first instead. Would these
algorithms perform better than BFS with parallel implementation. Yes/No Why?
怎么并行最好啊?
Design a parallel Breadth First Search algorithm for a directed weighted
graph.
Basically you need to find the minimum cost to reach to a node from the
starting node
. Calculate and output the optimum reachability cost for all the nodes from
a given starting point.
Implement in C with openMP.
1. How about using DFS or Shortest path first instead. Would these
algorithms perform better than BFS with parallel implementation. Yes/No Why?
怎么并行最好啊?