1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
#include <iostream>
#include <seqan/graph_algorithms.h>
using namespace seqan2;
int main()
{
typedef Graph<Directed<> > TGraph;
typedef VertexDescriptor<TGraph>::Type TVertexDescriptor;
typedef Size<TGraph>::Type TSize;
// Create graph with 10 directed edges (0,1), (0,3), ...
TSize numEdges = 10;
TVertexDescriptor edges[] = {0, 1, 0, 3, 1, 2, 1, 3, 2, 4, 3, 1, 3, 2, 3, 4, 4, 0, 4, 2};
TGraph g;
addEdges(g, edges, numEdges);
// Fill external edge weight map.
unsigned weights[] = {10, 5, 1, 2, 4, 3, 9, 2, 7, 6};
String<unsigned> weightMap;
assignEdgeMap(weightMap, g, weights);
// Run Dijkstra's algorithm from vertex 0.
String<unsigned> predMap;
String<unsigned> distMap;
dijkstra(predMap, distMap, g, 0, weightMap);
// Print results to stdout.
std::cout << "Single-Source Shortest Paths: \n";
typedef Iterator<TGraph, VertexIterator>::Type TVertexIterator;
TVertexIterator it(g);
while (!atEnd(it))
{
std::cout << "Path from 0 to " << getValue(it) << ": ";
_printPath(g, predMap, (TVertexDescriptor) 0, getValue(it));
std::cout << " (Distance: " << getProperty(distMap, getValue(it)) << ")\n";
goNext(it);
}
// We can achieve the same thing using an internal map that is edge cargos.
typedef unsigned int TEdgeCargo;
typedef Directed<TEdgeCargo> TEdges;
typedef Graph<TEdges> TCargoGraph;
// Construct graph with the same edges as above.
TCargoGraph cargoG;
addEdges(cargoG, edges, numEdges);
// Fill internal edge weight map.
InternalPropertyMap<TEdgeCargo> intMap;
assignEdgeMap(intMap, cargoG, weights);
// Run Dijkstra's algorithm from vertex 0.
clear(predMap);
clear(distMap);
dijkstra(predMap, distMap, cargoG, 0, intMap);
// Print result to stdout.
std::cout << "\nSingle-Source Shortest Paths: \n";
typedef Iterator<TCargoGraph, VertexIterator>::Type TCargoVertexIterator;
TCargoVertexIterator itC(cargoG);
while (!atEnd(itC))
{
std::cout << "Path from 0 to " << getValue(itC) << ": ";
_printPath(g, predMap, (TVertexDescriptor)0, getValue(itC));
std::cout << " (Distance: " << getProperty(distMap, getValue(itC)) << ")\n";
goNext(itC);
}
return 0;
}
|
