Changeset 1909:2d806130e700 in lemon-0.x for lemon/sub_graph.h

Timestamp:

01/26/06 16:42:13 (18 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

Undir -> U transition

File:

• lemon/sub_graph.h (modified) (3 diffs)

lemon/sub_graph.h

@@ -695 +695 @@
 //   class ResGraph
 //     : public IterableGraphExtender<EdgeSubGraphBase<
-//     UndirGraphAdaptor<Graph> > > {
+//     UGraphAdaptor<Graph> > > {
 //   public:
 //     typedef IterableGraphExtender<EdgeSubGraphBase<
-//       UndirGraphAdaptor<Graph> > > Parent;
+//       UGraphAdaptor<Graph> > > Parent;
 
 //   protected:
-//     UndirGraphAdaptor<Graph> undir;
+//     UGraphAdaptor<Graph> u;
 
 //     const CapacityMap* capacity;
@@ -719 +719 @@
 //   public:
 
-//     typedef typename UndirGraphAdaptor<Graph>::Node Node;
-//     typedef typename UndirGraphAdaptor<Graph>::Edge Edge;
-//     typedef typename UndirGraphAdaptor<Graph>::UndirEdge UndirEdge;
+//     typedef typename UGraphAdaptor<Graph>::Node Node;
+//     typedef typename UGraphAdaptor<Graph>::Edge Edge;
+//     typedef typename UGraphAdaptor<Graph>::UEdge UEdge;
 
 //     ResGraphAdaptor(Graph& _graph, 
 //                  const CapacityMap& _capacity, FlowMap& _flow) 
-//       : Parent(), undir(_graph), capacity(&_capacity), flow(&_flow),
+//       : Parent(), u(_graph), capacity(&_capacity), flow(&_flow),
 //      nodes(*this, _graph), edges(*this, _graph) {
-//       Parent::construct(undir, nodes, edges);
+//       Parent::construct(u, nodes, edges);
 //       setFlowMap(_flow);
 //       setCapacityMap(_capacity);
@@ -771 +771 @@
 //     }
 
-//     Edge direct(const UndirEdge& edge, bool direction) const {
+//     Edge direct(const UEdge& edge, bool direction) const {
 //       return Parent::getGraph().direct(edge, direction);
 //     }
 
-//     Edge direct(const UndirEdge& edge, const Node& node) const {
+//     Edge direct(const UEdge& edge, const Node& node) const {
 //       return Parent::getGraph().direct(edge, node);
 //     }