Category

Development Platform
Home > SourceCode/Document > Mathimatics-Numerical algorithms > View Code
transclosure.c
Package: leda.tar.gz　[view]
Upload User: gzelex
Upload Date: 2007-01-07
Package Size: 707k
Code Size: 1k
Category:

Mathimatics-Numerical algorithms

Development Platform:

MultiPlatform

transclosure.c：Code Content
  1. #include <LEDA/graph.h>
  2. #include <LEDA/graph_alg.h>
  6. main()
  7. {
  9. GRAPH<int,int> G;
  11. /*
  13. // Example from Mehlhorn volume II, page 11
  15. node n1,n2,n3,n4,n5,n6,n7;
  17. n1 = G.new_node(1);
  18. n2 = G.new_node(2);
  19. n3 = G.new_node(3);
  20. n4 = G.new_node(4);
  21. n5 = G.new_node(5);
  22. n6 = G.new_node(6);
  23. n7 = G.new_node(7);
  25. G.new_edge(n1,n3);
  26. G.new_edge(n2,n4);
  27. G.new_edge(n3,n5);
  28. G.new_edge(n4,n5);
  29. G.new_edge(n5,n6);
  30. G.new_edge(n5,n7);
  32. G.print();
  34. */
  36. test_graph(G);
  38. G.write("trans.ggg");
  40. cout << "TRANSITIVE_CLOSURE   ";
  41. cout.flush();
  42. float T = used_time();
  43. graph G1 = TRANSITIVE_CLOSURE(G);
  44. cout << string("    %6.2f secn",used_time(T));
  45. newline;
  46. if (Yes("ausgabe?")) G1.print();
  47. G.clear();
  48. G1.clear();
  50. return 0;
  52. }