Changeset 1627:3fd1ba6e9872 in lemon-0.x for lemon/concept/graph.h

Timestamp:

08/11/05 17:55:17 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Some modification on the undirected graph interface.
Doc improvments

File:

• lemon/concept/graph.h (modified) (6 diffs)

lemon/concept/graph.h

@@ -480 +480 @@
       ///
       /// Gives back the base node of the iterator.
+      /// It is always the target of the pointed edge.
       Node baseNode(const InEdgeIt&) const { return INVALID; }
 
@@ -485 +486 @@
       ///
       /// Gives back the running node of the iterator.
+      /// It is always the source of the pointed edge.
       Node runningNode(const InEdgeIt&) const { return INVALID; }
 
@@ -490 +492 @@
       ///
       /// Gives back the base node of the iterator.
+      /// It is always the source of the pointed edge.
       Node baseNode(const OutEdgeIt&) const { return INVALID; }
 
@@ -495 +498 @@
       ///
       /// Gives back the running node of the iterator.
+      /// It is always the target of the pointed edge.
       Node runningNode(const OutEdgeIt&) const { return INVALID; }
-      /// Read write map of the nodes to type \c T.
-
-      /// \ingroup concept
+
+      /// \brief The opposite node on the given edge.
+      ///
+      /// Gives back the opposite node on the given edge.
+      Node oppositeNode(const Node&, const Edge&) const { return INVALID; }
+
+      /// \brief Read write map of the nodes to type \c T.
+      /// 
       /// ReadWrite map of the nodes to type \c T.
       /// \sa Reference
@@ -520 +529 @@
       };
 
-      /// Read write map of the edges to type \c T.
-
-      /// \ingroup concept
-      ///Reference map of the edges to type \c T.
+      /// \brief Read write map of the edges to type \c T.
+      ///
+      /// Reference map of the edges to type \c T.
       /// \sa Reference
       /// \warning Making maps that can handle bool type (EdgeMap<bool>)
@@ -611 +619 @@
 
     };
-
-    
-    /************* New GraphBase stuff **************/
-
-
-//     /// A minimal GraphBase concept
-
-//     /// This class describes a minimal concept which can be extended to a
-//     /// full-featured graph with \ref GraphFactory.
-//     class GraphBase {
-//     public:
-
-//       GraphBase() {}
-
-//       /// \bug Should we demand that Node and Edge be subclasses of the
-//       /// Graph class???
-
-//       typedef GraphItem<'n'> Node;
-//       typedef GraphItem<'e'> Edge;
-
-// //       class Node : public BaseGraphItem<'n'> {};
-// //       class Edge : public BaseGraphItem<'e'> {};
-
-//       // Graph operation
-//       void firstNode(Node &n) const { }
-//       void firstEdge(Edge &e) const { }
-
-//       void firstOutEdge(Edge &e, Node) const { }
-//       void firstInEdge(Edge &e, Node) const { }
-
-//       void nextNode(Node &n) const { }
-//       void nextEdge(Edge &e) const { }
-
-
-//       // Question: isn't it reasonable if this methods have a Node
-//       // parameter? Like this:
-//       // Edge& nextOut(Edge &e, Node) const { return e; }
-//       void nextOutEdge(Edge &e) const { }
-//       void nextInEdge(Edge &e) const { }
-
-//       Node target(Edge) const { return Node(); }
-//       Node source(Edge) const { return Node(); }
-      
-
-//       // Do we need id, nodeNum, edgeNum and co. in this basic graphbase
-//       // concept?
-
-
-//       // Maps.
-//       //
-//       // We need a special slimer concept which does not provide maps (it
-//       // wouldn't be strictly slimer, cause for map-factory id() & friends
-//       // a required...)
-
-//       template<typename T>
-//       class NodeMap : public GraphMap<GraphBase, Node, T> {};
-
-//       template<typename T>
-//       class EdgeMap : public GraphMap<GraphBase, Node, T> {};
-//     };
-
+    
     // @}
   } //namespace concept