1.1 --- a/src/work/graphdemo.cc	Sun Apr 17 18:57:22 2005 +0000
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,137 +0,0 @@
     1.4 -#include <iostream>
     1.5 -#include <graph.h>
     1.6 -#include <bfs.h>
     1.7 -
     1.8 -using namespace NEGRO;
     1.9 -using namespace std;
    1.10 -
    1.11 -class NodeData;
    1.12 -class EdgeData;
    1.13 -
    1.14 -typedef Graph<NodeData,EdgeData> TestGraph;
    1.15 -
    1.16 -class NodeData
    1.17 -{
    1.18 -public:
    1.19 -  int id;
    1.20 -  bool isVis;
    1.21 -  bfs_node_data<TestGraph> bfs;
    1.22 -};
    1.23 -
    1.24 -class EdgeData
    1.25 -{
    1.26 -public:
    1.27 -  int id;
    1.28 -};
    1.29 -
    1.30 -typedef Graph<NodeData,EdgeData> TestGraph;
    1.31 -
    1.32 -int main()
    1.33 -{
    1.34 -  TestGraph G;
    1.35 -  TestGraph::NodeIterator n,m;
    1.36 -  TestGraph::OutEdgeIterator e;
    1.37 -  int i;
    1.38 -
    1.39 -  
    1.40 -  //for(i=1;i<=10;i++) G.AddNode().n=i; //Ez nagyon rossz!!!!!!!!
    1.41 -  for(i=1;i<=10;i++) G.AddNode()->id=i; //Ez a jo!!!!!!!!
    1.42 -
    1.43 -  //n=G.AddNode();
    1.44 -  
    1.45 -   //for(i=1;i<=10;i++) cout << (G.AddNode()->n=i) << ' ';
    1.46 -   //cout << '\n';
    1.47 - 
    1.48 -  i=0;
    1.49 -  for(G.GetFirst(n);n.Valid();n++)
    1.50 -    for(G.GetFirst(m);m.Valid();++m)
    1.51 -      if(n!=m) G.AddEdge(n,m)->id=++i;
    1.52 -   
    1.53 -  cout << "Number of edges: " << i << "\n\n";
    1.54 -
    1.55 -  TestGraph::AllEdgeIterator a;
    1.56 -  for(G.GetFirst(a);a.Valid();++a)
    1.57 -    cout << a->id << ":" << a.From()->id << "->" << a.To()->id << "   ";
    1.58 -
    1.59 -  cout << "\n\n\n";
    1.60 -  
    1.61 -  for(G.GetFirst(n);n.Valid();++n)
    1.62 -    {
    1.63 -      cout << n->id << "->";
    1.64 -      for(G.GetFirst(e,n);e.Valid();++e)
    1.65 -	cout << e->id << ":" << e.To()->id << ' ';
    1.66 -      cout << '\n';
    1.67 -    }
    1.68 -  
    1.69 -  cout << "\n\n\n\nB-verzio:\n\n\n";
    1.70 -  
    1.71 -  G.Clean();
    1.72 -
    1.73 -  for(i=1;i<=10;i++) G.AddNode()->id=i;
    1.74 -  
    1.75 -  i=0;
    1.76 -  for(n=G.First();n.Valid();n++)
    1.77 -    for(m=G.First();m.Valid();++m)
    1.78 -      if(n!=m) G.AddEdge(n,m)->id=++i;
    1.79 -   
    1.80 -  ;
    1.81 -  for(n=G.First();n.Valid();++n) //Demo
    1.82 -    {
    1.83 -      e=G.First(n);
    1.84 -      while(e.Valid())
    1.85 -	if((e->id)%2) G.Delete(e++);  //it may be nice to have a postfix ++
    1.86 -	else ++e;
    1.87 -    }
    1.88 -  
    1.89 -  // cout << "Number of edges: " << i << "\n\n";
    1.90 -
    1.91 -  for(a=G.First();a.Valid();++a)
    1.92 -    cout << a->id << ": " << a.From()->id << "->" << a.To()->id << "   ";
    1.93 -  
    1.94 -  cout << "\n\n\n";
    1.95 -  
    1.96 -  for(n=G.First();n.Valid();++n)
    1.97 -    {
    1.98 -      cout << n->id << "->";
    1.99 -      for(e=G.First(n);e.Valid();++e)
   1.100 -	cout << e->id << ":" << e.To()->id << ' ';
   1.101 -      cout << '\n';
   1.102 -    }
   1.103 -  
   1.104 -  // For Marci's sake
   1.105 -  
   1.106 -  {
   1.107 -    G.Clean();
   1.108 -    
   1.109 -    for(int i=1;i<=10;i++) G.AddNode()->id=i;
   1.110 -    
   1.111 -    
   1.112 -    {  //I would'n say I'm really happy with this.
   1.113 -      int i=0;
   1.114 -      for(TestGraph::NodeIterator n(G);n.Valid();n++)
   1.115 -	for(TestGraph::NodeIterator m(G);m.Valid();++m)
   1.116 -	  if(n!=m) G.AddEdge(n,m)->id=++i;
   1.117 -    }
   1.118 -    
   1.119 -    for(TestGraph::NodeIterator n(G);n.Valid();++n) //Demo
   1.120 -      {
   1.121 -	TestGraph::OutEdgeIterator e(G,n);
   1.122 -	while(e.Valid())
   1.123 -	  if((e->id)%2) G.Delete(e++);  //it may be nice to have a postfix ++
   1.124 -	  else ++e;
   1.125 -      }
   1.126 -    
   1.127 -    for(TestGraph::AllEdgeIterator a(G);a.Valid();++a)
   1.128 -      cout << a->id << ": " << a.From()->id << "->" << a.To()->id << "   ";
   1.129 -    
   1.130 -    cout << "\n\n\n";
   1.131 -    
   1.132 -    for(TestGraph::NodeIterator n(G);n.Valid();++n)
   1.133 -      {
   1.134 -	cout << n->id << "->";
   1.135 -	for(TestGraph::OutEdgeIterator e(G,n);e.Valid();++e)
   1.136 -	  cout << e->id << ":" << e.To()->id << ' ';
   1.137 -	cout << '\n';
   1.138 -      }
   1.139 -  }
   1.140 -}