Category

Development Platform
Home > SourceCode/Document > Mathimatics-Numerical algorithms > View Code
planar.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

planar.c：Code Content
  1. #include <LEDA/graph_alg.h>
  4. main(int argc,char** argv)
  5. {
  8. node v;
  9. int  i = 0;
  11. GRAPH<int,int> G;
  13. cmdline_graph(G,argc,argv);
  15. node_array<int> xcoord(G), ycoord(G);
  18. cout << "Planarity Test ... " << flush;
  20. float T = used_time();
  22. bool plan = PLANAR(G);  
  24. cout << string(" time = %.2f sec", used_time(T)) << endl;
  26. if (plan)  
  27.     cout << "Graph is planar" << endl;
  28. else
  29.    { cout << "Graph is not planar." << endl;
  30.      cout << "I compute a a Kuratowsky Subgraph ..." << endl;
  31.      list<edge> L;
  32.      edge e;
  34.      PLANAR(G,L);  
  35.      forall(e,L) 
  36.      { G.print_edge(e);
  37.        newline;
  38.       }
  39.      newline;
  41.     }
  43.   return 0;
  45. }