Changeset 2529:93de38566e6c in lemon-0.x
- Timestamp:
- 11/30/07 10:22:38 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3405
- Files:
-
- 6 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bin_heap.h
r2391 r2529 30 30 namespace lemon { 31 31 32 /// 33 34 /// A Binary Heap implementation.35 32 ///\ingroup auxdat 33 /// 34 ///\brief A Binary Heap implementation. 35 /// 36 36 ///This class implements the \e binary \e heap data structure. A \e heap 37 37 ///is a data structure for storing items with specified values called \e … … 230 230 231 231 /// \brief Decreases the priority of \c i to \c p. 232 232 /// 233 233 /// This method decreases the priority of item \c i to \c p. 234 234 /// \pre \c i must be stored in the heap with priority at least \c -
lemon/fib_heap.h
r2391 r2529 31 31 32 32 /// \ingroup auxdat 33 34 /// Fibonacci Heap.35 33 /// 34 ///\brief Fibonacci Heap. 35 /// 36 36 ///This class implements the \e Fibonacci \e heap data structure. A \e heap 37 37 ///is a data structure for storing items with specified values called \e -
lemon/graph_adaptor.h
r2422 r2529 35 35 #include <lemon/bits/graph_adaptor_extender.h> 36 36 #include <lemon/bits/graph_extender.h> 37 38 37 #include <lemon/tolerance.h> 39 38 … … 948 947 ///Graph::EdgeMap<int> flow(g, 0); 949 948 /// 950 ///Preflow<SubGA, int,ConstMap<Edge, int>, Graph::EdgeMap<int> >951 /// preflow(ga, s, t, const_1_map, flow);949 ///Preflow<SubGA, ConstMap<Edge, int>, Graph::EdgeMap<int> > 950 /// preflow(ga, const_1_map, s, t); 952 951 ///preflow.run(); 953 952 ///\endcode … … 959 958 /// << endl; 960 959 ///for(EdgeIt e(g); e!=INVALID; ++e) 961 /// if ( flow[e])960 /// if (preflow.flow(e)) 962 961 /// cout << " " << g.id(g.source(e)) << "--" 963 962 /// << length[e] << "->" << g.id(g.target(e)) << endl; … … 2022 2021 return INVALID; 2023 2022 } 2023 2024 2024 2025 2025 template <typename T> … … 2031 2031 NodeMap(const SplitGraphAdaptorBase& _graph, const T& t) 2032 2032 : inNodeMap(_graph, t), outNodeMap(_graph, t) {} 2033 2033 NodeMap& operator=(const NodeMap& cmap) { 2034 return operator=<NodeMap>(cmap); 2035 } 2036 template <typename CMap> 2037 NodeMap& operator=(const CMap& cmap) { 2038 Parent::operator=(cmap); 2039 return *this; 2040 } 2041 2034 2042 void set(const Node& key, const T& val) { 2035 2043 if (SplitGraphAdaptorBase::inNode(key)) { inNodeMap.set(key, val); } … … 2063 2071 EdgeMap(const SplitGraphAdaptorBase& _graph, const T& t) 2064 2072 : edge_map(_graph, t), node_map(_graph, t) {} 2073 EdgeMap& operator=(const EdgeMap& cmap) { 2074 return operator=<EdgeMap>(cmap); 2075 } 2076 template <typename CMap> 2077 EdgeMap& operator=(const CMap& cmap) { 2078 Parent::operator=(cmap); 2079 return *this; 2080 } 2065 2081 2066 2082 void set(const Edge& key, const T& val) { … … 2471 2487 /// SGraph::EdgeMap<int> sflow(sgraph); 2472 2488 /// 2473 /// Preflow<SGraph, int,SCapacity>2474 /// spreflow(sgraph, SGraph::outNode(source),SGraph::inNode(target),2475 /// scapacity, sflow);2489 /// Preflow<SGraph, SCapacity> 2490 /// spreflow(sgraph, scapacity, 2491 /// SGraph::outNode(source), SGraph::inNode(target)); 2476 2492 /// 2477 2493 /// spreflow.run(); -
lemon/min_mean_cycle.h
r2517 r2529 20 20 #define LEMON_MIN_MEAN_CYCLE_H 21 21 22 /// \ingroup min_cost_flow22 /// \ingroup shortest_path 23 23 /// 24 24 /// \file … … 32 32 namespace lemon { 33 33 34 /// \addtogroup min_cost_flow34 /// \addtogroup shortest_path 35 35 /// @{ 36 36 -
lemon/topology.h
r2429 r2529 716 716 /// \param graph The graph. 717 717 /// \return %True when the graph bi-node-connected. 718 /// \todo Make it faster.719 718 template <typename UGraph> 720 719 bool biNodeConnected(const UGraph& graph) { … … 1043 1042 /// \param graph The undirected graph. 1044 1043 /// \return The number of components. 1045 /// \todo Make it faster.1046 1044 template <typename UGraph> 1047 1045 bool biEdgeConnected(const UGraph& graph) { -
test/graph_adaptor_test.cc
r2391 r2529 67 67 Graph::NodeMap<Graph::Edge> > >(); 68 68 69 checkConcept<Graph, SplitGraphAdaptor<Graph> >(); 70 69 71 checkConcept<UGraph, UndirGraphAdaptor<Graph> >(); 70 72
Note: See TracChangeset
for help on using the changeset viewer.