Changeset 70:851ca9a60e90 in lemon-0.x for src/work

Timestamp:

02/10/04 14:29:15 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@86

Message:

.

File:

• src/work/alpar/gwrapper.h (modified) (1 diff)

src/work/alpar/gwrapper.h

@@ -84 +84 @@
   NodeIt tail(const EdgeIt &e);
   { return graph->head(e); }
+  
+  template<typename I> NodeIt aNode(const I e);
+  { return graph->aNode(e); }
+  template<typename I> NodeIt bNode(const I e);
+  { return graph->bNode(e); }
+  
+  template<typename I> bool valid(const I i);
+  { return graph->valid(i); }
+  
+  template<typename I> void setInvalid(const I &i);
+  { return graph->setInvalid(i); }
+  
+  NodeIt addNode(); { return graph->addNode(); }
+  EdgeIt addEdge(const NodeIt from,const NodeIt to);
+  { return graph->addEdge(to,from); }
+  
+  template<I> void delete(I i); { graph->delete(i); }
+  
+  void clean();  { graph->clean(); }
+  
+  template<class T> class NodeMap : public typename G::NodeMap<T>;
+  template<class T> class EdgeMap : public typename G::EdgeMap<T>;
+  
+  void SetG(G &g) {graph = &g;}
+  
+  RevGraphWrapper() {graph = NULL;}
+  RevGraphWrapper(G &g) {graph = &g;}
+};
+
+template<typename G>
+class SymGraphWrapper
+{
+  G *graph;
+  
+public:
+  typedef G BaseGraph;
+
+  typedef typename G::EdgeIt EdgeIt;
+  
+  typedef typename G::InEdgeIt SymEdgeIt;
+  typedef typename G::OutEdgeIt SymEdgeIt;
+  typedef typename G::SymEdgeIt SymEdgeIt;
+  typedef typename G::EachEdgeIt EachEdgeIt;
+
+  typedef typename G::NodeIt NodeIt;
+    
+  template<typename I> I &getFirst(I &i); { return graph->getFirst(i); }
+  template<typename I,typename P> I &getFirst(I &i,const P &p);
+  { return graph->getFirst(i,p); }
+  template<typename I> I next(const I i); { return graph->goNext(i); }
+  template<typename I> I &goNext(I &i); { return graph->goNext(i); }
+
+  NodeIt head(const EdgeIt &e);
+  { return graph->head(e); }
+  NodeIt tail(const EdgeIt &e);
+  { return graph->tail(e); }
+  
+  template<typename I> NodeIt aNode(const I e);
+  { return graph->aNode(e); }
+  template<typename I> NodeIt bNode(const I e);
+  { return graph->bNode(e); }
+  
+  template<typename I> bool valid(const I i);
+  { return graph->valid(i); }
+  
+  template<typename I> void setInvalid(const I &i);
+  { return graph->setInvalid(i); }
+  
+  NodeIt addNode(); { return graph->addNode(); }
+  EdgeIt addEdge(const NodeIt from,const NodeIt to);
+  { return graph->addEdge(to,from); }
+  
+  template<I> void delete(I i); { graph->delete(i); }
+  
+  void clean();  { graph->clean(); }
+  
+  template<class T> class NodeMap : public typename G::NodeMap<T>;
+  template<class T> class EdgeMap : public typename G::EdgeMap<T>;
+  
+  void SetG(G &g) {graph = &g;}
+  
+  RevGraphWrapper() {graph = NULL;}
+  RevGraphWrapper(G &g) {graph = &g;}
+};
+
+
+// FIXME: comparison should be made better!!!
+template<typename G, typename lomap, typename fmap, typename himap>
+class ResGraphWrapper
+{
+  G *graph;
+  
+public:
+  typedef G BaseGraph;
+
+  typedef typename G::EdgeIt EdgeIt;
+  
+  class InEdgeIt 
+  {
+  public:
+    G::NodeIt n;
+    G::InEdgeIt i;   
+    G::OutEdgeIt o;
+  }
+  class OutEdgeIt 
+  {
+  public:
+    G::NodeIt n;
+    G::InEdgeIt i;   
+    G::OutEdgeIt o;
+  }
+  typedef typename G::SymEdgeIt SymEdgeIt;
+  typedef typename G::EachEdgeIt EachEdgeIt;
+
+  typedef typename G::NodeIt NodeIt;
+    
+  NodeIt &getFirst(NodeIt &n); { return graph->getFirst(n); }
+
+  // EachEdge and SymEdge  is missing!!!!
+  // EdgeIt <-> In/OutEdgeIt conversion is missing!!!!
+
+  InEdgeIt &getFirst(InEdgeIt &e,const NodeIt &n)
+  {
+    e.n=n;
+    graph->getFirst(e.i,n);
+    while(graph->valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
+      graph->goNext(e.i);
+    if(!graph->valid(e.i)) {
+      graph->getFirst(e.o,n);
+      while(graph->valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
+        graph->goNext(e.o);
+    }
+    return e;
+  }
+  InEdgeIt &goNext(InEdgeIt &e)
+  {
+    if(graph->valid(e.i)) {
+      while(graph->valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
+        graph->goNext(e.i);
+      if(graph->valid(e.i)) return e;
+      else graph->getFirst(e.o,e.n);
+    }
+    else {
+      while(graph->valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
+        graph->goNext(e.o);
+      return e;
+    }
+  }
+  InEdgeIt Next(const InEdgeIt &e) {InEdgeIt t(e); return goNext(t);}
+  bool valid(const InEdgeIt e) { return graph->valid(e.i)||graph->valid(e.o);}
+
+  OutEdgeIt &getFirst(OutEdgeIt &e,const NodeIt &n)
+  {
+    e.n=n;
+    graph->getFirst(e.o,n);
+    while(graph->valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
+      graph->goNext(e.o);
+    if(!graph->valid(e.o)) {
+      graph->getFirst(e.i,n);
+      while(graph->valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
+        graph->goNext(e.i);
+    }
+    return e;
+  }
+  OutEdgeIt &goNext(OutEdgeIt &e)
+  {
+    if(graph->valid(e.o)) {
+      while(graph->valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
+        graph->goNext(e.o);
+      if(graph->valid(e.o)) return e;
+      else graph->getFirst(e.i,e.n);
+    }
+    else {
+      while(graph->valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
+        graph->goNext(e.i);
+      return e;
+    }
+  }
+  OutEdgeIt Next(const OutEdgeIt &e) {OutEdgeIt t(e); return goNext(t);}
+  bool valid(const OutEdgeIt e) { return graph->valid(e.o)||graph->valid(e.i);}
+
+  template<typename I> I &goNext(I &i); { return graph->goNext(i); }
+  template<typename I> I next(const I i); { return graph->goNext(i); }
+
+  NodeIt head(const EdgeIt &e);
+  { return graph->head(e); }
+  NodeIt tail(const EdgeIt &e);
+  { return graph->tail(e); }
   
   template<typename I> NodeIt aNode(const I e);