Changeset 1527:7ceab500e1f6 in lemon-0.x for lemon

Ignore:
Timestamp:
07/01/05 12:33:27 (17 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2014
Message:

Doc review+corrections in my own documentation according to the reviewers comments.

Location:
lemon
Files:
3 edited

Unmodified
Removed
• lemon/concept/sym_graph.h

 r1526 /// or it can serve as a skeleton of a new symmetric graph structure. /// /// Also, you will find here the full documentation of a certain graph /// feature, the documentation of a real symmetric graph imlementation /// Also, you will find here the full documentation of graph /// features, the documentation of a real symmetric graph imlementation /// like @ref SymListGraph or /// @ref lemon::SymSmartGraph will just refer to this structure. /// StaticSymGraph() { } ///Copy consructor. //      ///Copy consructor. //       ///\todo It is not clear, what we expect from a copy constructor. /// Inequality operator /// \sa operator==(Node n) /// \sa operator==(Node) /// bool operator!=(Node) const { return true; } /// Sets the iterator to the node of \c g pointed by the trivial /// iterator n. /// iterator \c n. /// This feature necessitates that each time we /// iterate the edge-set, the iteration order is the same. /// iterate the node-set, the iteration order is the same. NodeIt(const StaticSymGraph& g, const Node& n) { } /// Next node. /// This constructor sets the iterator to first outgoing edge. /// This constructor set the iterator to the first outgoing edge of /// node /// This constructor sets the iterator to the first outgoing edge of /// the node ///@param n the node ///@param g the graph /// This constructor sets the iterator to first incoming edge. /// This constructor set the iterator to the first incoming edge of /// node /// This constructor sets the iterator to the first incoming edge of /// the node ///@param n the node ///@param g the graph /// This constructor sets the iterator to first edge. /// This constructor set the iterator to the first edge of /// node /// This constructor sets the iterator to the first edge of /// the graph ///@param g the graph SymEdgeIt(const StaticSymGraph& g) { } /// This constructor sets the iterator to first edge. /// This constructor set the iterator to the first edge of /// node /// This constructor sets the iterator to the first edge of /// the graph ///@param g the graph EdgeIt(const StaticSymGraph& g) { } /// An empty non-static graph class. /// This class provides everything that \ref StaticGraph /// with additional functionality which enables to build a /// This class is an extension of \ref StaticGraph /// with additional functionality that enables one to build a /// graph from scratch. class ExtendableSymGraph : public StaticSymGraph class ExtendableSymGraph : public StaticSymGraph { public: /// An empty erasable graph class. /// This class is an extension of \ref ExtendableGraph. It also makes it /// possible to erase edges or nodes. /// This class is an extension of \ref ExtendableGraph. It is also /// possible to erase edges or nodes in this graph. class ErasableSymGraph : public ExtendableSymGraph {
• lemon/min_cost_flow.h

 r1435 /// The class \ref lemon::MinCostFlow "MinCostFlow" implements an /// algorithm for finding a flow of value \c k having minimal total /// cost from a given source node to a given target node in an /// edge-weighted directed graph. To this end, the edge-capacities /// and edge-weights have to be nonnegative.  The edge-capacities /// should be integers, but the edge-weights can be integers, reals /// or of other comparable numeric type.  This algorithm is intended /// to be used only for small values of \c k, since it is only /// polynomial in k, not in the length of k (which is log k): in /// order to find the minimum cost flow of value \c k it finds the /// minimum cost flow of value \c i for every \c i between 0 and \c /// k. /// cost from a given source node to a given target node in a /// directed graph with a cost function on the edges. To /// this end, the edge-capacities and edge-costs have to be /// nonnegative.  The edge-capacities should be integers, but the /// edge-costs can be integers, reals or of other comparable /// numeric type.  This algorithm is intended to be used only for /// small values of \c k, since it is only polynomial in k, not in /// the length of k (which is log k): in order to find the minimum /// cost flow of value \c k it finds the minimum cost flow of value /// \c i for every \c i between 0 and \c k. /// ///\param Graph The directed graph type the algorithm runs on. \param _g The directed graph the algorithm runs on. \param _length The length (weight or cost) of the edges. \param _length The length (cost) of the edges. \param _cap The capacity of the edges. \param _s Source node. } /// Total weight of the found flow. /// This function gives back the total weight of the found flow. /// Total cost of the found flow. /// This function gives back the total cost of the found flow. Length totalLength(){ return total_length;
• lemon/suurballe.h

 r1435 /// edge-weighted directed graph having minimal total weight (length). /// ///\warning Length values should be nonnegative. ///\warning Length values should be nonnegative! /// ///\param Graph The directed graph type the algorithm runs on. paths.clear(); //total_length=0; paths.resize(k); for (int j=0; j void getPath(Path& p, size_t j){
Note: See TracChangeset for help on using the changeset viewer.