transclosure.c
资源名称:leda.tar.gz [点击查看]
上传用户:gzelex
上传日期:2007-01-07
资源大小:707k
文件大小:1k
源码类别:
数值算法/人工智能
开发平台:
MultiPlatform
- #include <LEDA/graph.h>
- #include <LEDA/graph_alg.h>
- main()
- {
- GRAPH<int,int> G;
- /*
- // Example from Mehlhorn volume II, page 11
- node n1,n2,n3,n4,n5,n6,n7;
- n1 = G.new_node(1);
- n2 = G.new_node(2);
- n3 = G.new_node(3);
- n4 = G.new_node(4);
- n5 = G.new_node(5);
- n6 = G.new_node(6);
- n7 = G.new_node(7);
- G.new_edge(n1,n3);
- G.new_edge(n2,n4);
- G.new_edge(n3,n5);
- G.new_edge(n4,n5);
- G.new_edge(n5,n6);
- G.new_edge(n5,n7);
- G.print();
- */
- test_graph(G);
- G.write("trans.ggg");
- cout << "TRANSITIVE_CLOSURE ";
- cout.flush();
- float T = used_time();
- graph G1 = TRANSITIVE_CLOSURE(G);
- cout << string(" %6.2f secn",used_time(T));
- newline;
- if (Yes("ausgabe?")) G1.print();
- G.clear();
- G1.clear();
- return 0;
- }