1.1 --- a/src/work/johanna/ma_order_test.cc Sun Apr 17 18:57:22 2005 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,57 +0,0 @@
1.4 -#include <string>
1.5 -#include <iostream>
1.6 -#include <map>
1.7 -#include <vector>
1.8 -
1.9 -#include <ma_order.h>
1.10 -#include <list_graph.h>
1.11 -
1.12 -
1.13 -using namespace std;
1.14 -using namespace lemon;
1.15 -
1.16 -int main() {
1.17 -
1.18 - typedef ListGraph::Node Node;
1.19 - typedef ListGraph::Edge Edge;
1.20 - typedef ListGraph::NodeIt NodeIt;
1.21 - typedef ListGraph::EdgeIt EdgeIt;
1.22 -
1.23 - ListGraph G;
1.24 -
1.25 - Node v3=G.addNode();
1.26 - Node v5=G.addNode();
1.27 - Node v2=G.addNode();
1.28 - Node v0=G.addNode();
1.29 - Node v4=G.addNode();
1.30 - Node v1=G.addNode();
1.31 -
1.32 - G.addEdge(v0, v1);G.addEdge(v0, v1);G.addEdge(v0, v1);
1.33 - G.addEdge(v0, v2);
1.34 - G.addEdge(v0, v3);G.addEdge(v0, v3);
1.35 - G.addEdge(v1, v2);G.addEdge(v1, v2);
1.36 - G.addEdge(v2, v4);
1.37 - G.addEdge(v3, v4);
1.38 - G.addEdge(v4, v5);
1.39 -
1.40 - G.addEdge(v1, v0);G.addEdge(v1, v0);G.addEdge(v1, v0);
1.41 - G.addEdge(v2, v0);
1.42 - G.addEdge(v3, v0);G.addEdge(v3, v0);
1.43 - G.addEdge(v2, v1);G.addEdge(v2, v1);
1.44 - G.addEdge(v4, v2);
1.45 - G.addEdge(v4, v3);
1.46 - G.addEdge(v5, v4);
1.47 -
1.48 -
1.49 - vector<Node> ma_order;
1.50 - MAOrder<ListGraph> mao(G,ma_order);
1.51 - mao.run(v0);
1.52 - vector<Node>::iterator i;
1.53 - for (i = ma_order.begin(); i!=ma_order.end(); ++i) {
1.54 - cout << *i << " ";
1.55 - }
1.56 - cout << endl;
1.57 - cout << v0 << " " << v1 << " " << v2 << " " << v3 << " " << v4 << " "
1.58 - << v5 << endl;
1.59 -
1.60 -}