# Changeset 1162:404b98971e1f in lemon

Ignore:
Timestamp:
09/13/12 12:13:19 (7 years ago)
Branch:
default
Parents:
1155:b6347aae6575 (diff), 1160:00f8d9f9920d (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge #449

Files:
6 edited

Unmodified
Removed

• ## lemon/bits/edge_set_extender.h

 r1110 // Returns the base node of the iterator Node baseNode(const IncEdgeIt &e) const { return e.direction ? u(e) : v(e); return e.direction ? this->u(e) : this->v(e); } // Running node of the iterator // Returns the running node of the iterator Node runningNode(const IncEdgeIt &e) const { return e.direction ? v(e) : u(e); return e.direction ? this->v(e) : this->u(e); }
• ## lemon/concepts/graph_components.h

 r1127 _GraphItemIt it3 = it1; _GraphItemIt it4 = INVALID; ignore_unused_variable_warning(it3); ignore_unused_variable_warning(it4); it2 = ++it1; _GraphIncIt it3 = it1; _GraphIncIt it4 = INVALID; ignore_unused_variable_warning(it3); ignore_unused_variable_warning(it4); it2 = ++it1;
• ## lemon/core.h

 r1159 } /// \brief Check whether a graph is undirected. /// /// This function returns \c true if the given graph is undirected. #ifdef DOXYGEN template bool undirected(const GR& g) { return false; } #else template typename enable_if, bool>::type undirected(const GR&) { return true; } template typename disable_if, bool>::type undirected(const GR&) { return false; } #endif /// \brief Class to copy a digraph.
• ## lemon/path.h

 r1146 /// /// In a sense, the path can be treated as a list of arcs. The /// lemon path type stores just this list. As a consequence, it /// LEMON path type stores just this list. As a consequence, it /// cannot enumerate the nodes of the path and the source node of /// a zero length path is undefined. void clear() { head.clear(); tail.clear(); } /// \brief The nth arc. /// \brief The n-th arc. /// /// \pre \c n is in the [0..length() - 1] range. } /// \brief Initialize arc iterator to point to the nth arc /// \brief Initialize arc iterator to point to the n-th arc /// /// \pre \c n is in the [0..length() - 1] range. /// /// In a sense, the path can be treated as a list of arcs. The /// lemon path type stores just this list. As a consequence it /// LEMON path type stores just this list. As a consequence it /// cannot enumerate the nodes in the path and the zero length paths /// cannot store the source. void clear() { data.clear(); } /// \brief The nth arc. /// \brief The n-th arc. /// /// \pre \c n is in the [0..length() - 1] range. } /// \brief  Initializes arc iterator to point to the nth arc. /// \brief  Initializes arc iterator to point to the n-th arc. ArcIt nthIt(int n) const { return ArcIt(*this, n); /// /// In a sense, the path can be treated as a list of arcs. The /// lemon path type stores just this list. As a consequence it /// LEMON path type stores just this list. As a consequence it /// cannot enumerate the nodes in the path and the zero length paths /// cannot store the source. }; /// \brief The nth arc. /// /// This function looks for the nth arc in O(n) time. /// \brief The n-th arc. /// /// This function looks for the n-th arc in O(n) time. /// \pre \c n is in the [0..length() - 1] range. const Arc& nth(int n) const { } /// \brief Initializes arc iterator to point to the nth arc. /// \brief Initializes arc iterator to point to the n-th arc. ArcIt nthIt(int n) const { Node *node = first; /// /// In a sense, the path can be treated as a list of arcs. The /// lemon path type stores just this list. As a consequence it /// LEMON path type stores just this list. As a consequence it /// cannot enumerate the nodes in the path and the source node of /// a zero length path is undefined. }; /// \brief The nth arc. /// \brief The n-th arc. /// /// \pre \c n is in the [0..length() - 1] range. } /// \brief The arc iterator pointing to the nth arc. /// \brief The arc iterator pointing to the n-th arc. ArcIt nthIt(int n) const { return ArcIt(*this, n); /// /// In a sense, the path can be treated as a list of arcs. The /// lemon path type stores only this list. As a consequence, it /// LEMON path type stores only this list. As a consequence, it /// cannot enumerate the nodes in the path and the zero length paths /// cannot have a source node.
• ## test/CMakeLists.txt

 r1159 maps_test matching_test max_cardinality_search_test max_clique_test min_cost_arborescence_test min_cost_flow_test min_mean_cycle_test nagamochi_ibaraki_test path_test planarity_test
Note: See TracChangeset for help on using the changeset viewer.