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
|
#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 9 directed edges (0,3), (0,1), ...
TSize numEdges = 9;
TVertexDescriptor edges[] = {0, 3, 0, 1, 1, 2, 3, 2, 5, 7, 5, 6, 6, 7, 6, 3, 8, 7};
TGraph g;
addEdges(g, edges, numEdges);
// Print graph.
std::cout << g << "\n";
// Create external property map with vertex labels.
String<std::string> nameMap;
std::string names[] = {"shirt", "tie", "jacket", "belt", "watch", "undershorts", "pants", "shoes", "socks"};
assignVertexMap(nameMap, g, names);
// Get vertex descriptor in topological sort order.
String<TVertexDescriptor> order;
topologicalSort(order, g);
// Write the result to stdout.
std::cout << "Topological sort: \n";
typedef Iterator<String<TVertexDescriptor> >::Type TStringIterator;
TStringIterator it = begin(order);
TStringIterator itEnd = end(order);
while (it != itEnd)
{
std::cout << getProperty(nameMap, getValue(it)) << ",";
goNext(it);
}
std::cout << "\n";
return 0;
}
|
