Line | |
---|
1 | 1.Prim |
---|
2 | |
---|
3 | To build the input file for the parallel version of Prim and the serial version |
---|
4 | with a cost matrix, compile and run agenerate1.c .It will build a complete graph |
---|
5 | with random values for the costs of the edges. |
---|
6 | To build the input file for the serial version with adjacency lists first |
---|
7 | compile and run agenerate1.c and after that agenerate2.c .The input file will |
---|
8 | represent a graph equivalent with the one represented by the file built with |
---|
9 | agenerate1.c . |
---|
10 | |
---|
11 | 2.Dijkstra |
---|
12 | |
---|
13 | To build the input file for the parallel version of Dijkstra and |
---|
14 | the serial version with a cost matrix, compile and run buildR.cpp. |
---|
15 | It will build a complete graph with random cost edges with values between |
---|
16 | 1 and 100. |
---|
17 | To build the input file for the serial version with adjacency lists, first |
---|
18 | run and compile buildR.cpp and after that generate2.c.It will build an input |
---|
19 | file that represents the same complete graph as the one created with buildR.cpp. |
---|
20 | |
---|
21 | 3.Bellman-Ford |
---|
22 | |
---|
23 | For Bellman-Ford I recommend using as input file the grader_test10.in file because |
---|
24 | it has the greatest number of nodes and edges and shows clearly that the |
---|
25 | parallel version with OpenMP is inferior to the serial one because of the |
---|
26 | thread creation and destruction overhead.You just have to rename the grader_test10.in file |
---|
27 | as bell.in.The aproximate times for this input file were: |
---|
28 | -For the serial version 0.5 seconds |
---|
29 | -The parallel version 2 seconds |
---|
30 | |
---|
31 | 4.Roy-Floyd |
---|
32 | |
---|
33 | To build the input file for the Roy-Floyd algorithms just compile and run the buildRoy.cpp file. |
---|
34 | It will build an input file that represents a complete graph with random cost edges between 1 and 100. |
---|
35 | |
---|
36 | |
---|
37 | |
---|
38 | |
---|
39 | |
---|
40 | |
---|
41 | |
---|
42 | |
---|
43 | |
---|
44 | |
---|
45 | |
---|
46 | |
---|
47 | |
---|
48 | |
---|
49 | |
---|
50 | |
---|
51 | |
---|
Note: See
TracBrowser
for help on using the repository browser.