| Example Program Depth-First Search Depth-first search through a graph. A tutorial about depth-first search.
| 1 | #include <iostream>
| | 2 | #include <seqan/graph_algorithms.h>
| | 3 |
| | 4 | using namespace seqan;
| | 5 |
| | 6 |
| | 7 | int main()
| | 8 | {
| | 9 | typedef Graph<Directed<> > TGraph;
| | 10 | typedef VertexDescriptor<TGraph>::Type TVertexDescriptor;
| | 11 | typedef EdgeDescriptor<TGraph>::Type TEdgeDescriptor;
| | 12 | typedef Size<TGraph>::Type TSize;
|
| 13 | TSize numEdges = 8;
| | 14 | TVertexDescriptor edges[] = {0,3, 0,1, 1,4, 2,4, 2,5, 3,1, 4,3, 5,5};
| | 15 | TGraph g;
| | 16 | addEdges(g, edges, numEdges);
| | 17 | ::std::cout << g << ::std::endl;
|
| 18 | char names[] = {'u', 'v', 'w', 'x', 'y', 'z'};
| | 19 | String<char> nameMap;
| | 20 | resizeVertexMap(g,nameMap, names);
|
| 21 | String<unsigned int> predMap;
| | 22 | String<unsigned int> discoveryTimeMap;
| | 23 | String<unsigned int> finishingTimeMap;
|
| 24 | depthFirstSearch(g, predMap, discoveryTimeMap, finishingTimeMap);
|
| 25 | ::std::cout << "Depth-First search: " << ::std::endl;
| | 26 | typedef Iterator<Graph<>, VertexIterator>::Type TVertexIterator;
| | 27 | TVertexIterator it(g);
| | 28 | while(!atEnd(it)) {
| | 29 | ::std::cout << "Vertex " << getProperty(nameMap, getValue(it)) << ": ";
| | 30 | ::std::cout << "Discovery time = " << getProperty(discoveryTimeMap, getValue(it)) << ",";
| | 31 | ::std::cout << "Finishing time = " << getProperty(finishingTimeMap, getValue(it)) << ",";
| | 32 | typedef Value<String<unsigned int> >::Type TPredVal;
| | 33 | TPredVal pre = getProperty(predMap, getValue(it));
| | 34 | if (pre != getNil<TVertexDescriptor>()) {
| | 35 | ::std::cout << "Predecessor = " << getProperty(nameMap, pre) << ::std::endl;
| | 36 | } else {
| | 37 | ::std::cout << "Predecessor = nil" << ::std::endl;
| | 38 | }
| | 39 | goNext(it);
| | 40 | }
| | 41 | return 0;
| | 42 | }
|
|