Changeset 1419:c3244a26adb1 in lemon-0.x for src/lemon/graph_utils.h

Timestamp:

05/14/05 19:34:31 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Added backward and forward map.
Converting UndirEdge? -> Edge

File:

• src/lemon/graph_utils.h (modified) (8 diffs)

src/lemon/graph_utils.h

@@ -19 +19 @@
 
 #include <iterator>
+#include <vector>
 #include <map>
 
@@ -267 +268 @@
 
   template <typename _Graph, typename _Item>
-  class ItemSetTraits {
-  };
+  class ItemSetTraits {};
   
   template <typename _Graph>
@@ -362 +362 @@
   };
 
-
   /// Provides an immutable and unique id for each item in the graph.
 
@@ -376 +375 @@
     typedef _Item Key;
 
+    typedef True NeedCopy;
+
     /// \brief Constructor.
     ///
@@ -398 +399 @@
     class InverseMap {
     public:
+
+      typedef True NeedCopy;
+
       /// \brief Constructor.
       ///
@@ -694 +698 @@
   class SourceMap {
   public:
+
+    typedef True NeedCopy;
+
     typedef typename Graph::Node Value;
     typedef typename Graph::Edge Key;
@@ -732 +739 @@
   class TargetMap {
   public:
+
+    typedef True NeedCopy;
+
     typedef typename Graph::Node Value;
     typedef typename Graph::Edge Key;
@@ -763 +773 @@
   }
 
+  /// \brief Returns the "forward" directed edge view of undirected edge.
+  ///
+  /// Returns the "forward" directed edge view of undirected edge.
+  /// \author Balazs Dezso
+  template <typename Graph>
+  class ForwardMap {
+  public:
+
+    typedef True NeedCopy;
+
+    typedef typename Graph::Edge Value;
+    typedef typename Graph::UndirEdge Key;
+
+    /// \brief Constructor
+    ///
+    /// Constructor
+    /// \param _graph The graph that the map belongs to.
+    ForwardMap(const Graph& _graph) : graph(_graph) {}
+
+    /// \brief The subscript operator.
+    ///
+    /// The subscript operator.
+    /// \param key An undirected edge 
+    /// \return The "forward" directed edge view of undirected edge 
+    Value operator[](const Key& key) const {
+      return graph.edgeWithSource(key, graph.source(key));
+    }
+
+  private:
+    const Graph& graph;
+  };
+
+  /// \brief Returns a \ref ForwardMap class
+
+  /// This function just returns an \ref ForwardMap class.
+  /// \relates ForwardMap
+  template <typename Graph>
+  inline ForwardMap<Graph> forwardMap(const Graph& graph) {
+    return ForwardMap<Graph>(graph);
+  }
+
+  /// \brief Returns the "backward" directed edge view of undirected edge.
+  ///
+  /// Returns the "backward" directed edge view of undirected edge.
+  /// \author Balazs Dezso
+  template <typename Graph>
+  class BackwardMap {
+  public:
+    typedef True NeedCopy;
+
+    typedef typename Graph::Edge Value;
+    typedef typename Graph::UndirEdge Key;
+
+    /// \brief Constructor
+    ///
+    /// Constructor
+    /// \param _graph The graph that the map belongs to.
+    BackwardMap(const Graph& _graph) : graph(_graph) {}
+
+    /// \brief The subscript operator.
+    ///
+    /// The subscript operator.
+    /// \param key An undirected edge 
+    /// \return The "backward" directed edge view of undirected edge 
+    Value operator[](const Key& key) const {
+      return graph.edgeWithSource(key, graph.target(key));
+    }
+
+  private:
+    const Graph& graph;
+  };
+
+  /// \brief Returns a \ref BackwardMap class
+
+  /// This function just returns an \ref BackwardMap class.
+  /// \relates BackwardMap
+  template <typename Graph>
+  inline BackwardMap<Graph> backwardMap(const Graph& graph) {
+    return BackwardMap<Graph>(graph);
+  }
+
 
   /// @}