COIN-OR::LEMON - Graph Library

Changeset 825:738abd9d1262 in lemon-0.x


Ignore:
Timestamp:
09/09/04 09:09:41 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1121
Message:

Improved docs.

Location:
src
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/list_graph.h

    r822 r825  
    2626/// @{
    2727
    28 //  class SymListGraph;
    29 
    3028  ///A list graph class.
    3129
     
    3331  ///
    3432  ///It conforms to the graph interface documented under
    35   ///the description of \ref GraphSkeleton.
    36   ///\sa \ref GraphSkeleton.
     33  ///the description of \ref ErasableGraphSkeleton.
     34  ///\sa \ref ErasableGraphSkeleton.
    3735  class ListGraph {
    3836
     
    4341      int first_in,first_out;
    4442      int prev, next;
    45       //      NodeT() {}
    4643    };
    4744    //Edges are double linked.
     
    5249      int prev_in, prev_out;
    5350      int next_in, next_out;
    54       //FIXME: is this necessary?
    55       //      EdgeT() : next_in(-1), next_out(-1) prev_in(-1), prev_out(-1) {} 
    5651    };
    5752
  • src/test/test_tools.h

    r774 r825  
    3535template<class Graph> struct PetStruct
    3636{
    37   ///.
    38   std::vector<typename Graph::Node> outer, inner;
    39   ///.
    40   std::vector<typename Graph::Edge> outcir, incir, chords;
     37  ///Vector containing the outer nodes.
     38  std::vector<typename Graph::Node> outer;
     39  ///Vector containing the inner nodes.
     40  std::vector<typename Graph::Node> inner;
     41  ///Vector containing the edges of the inner circle.
     42  std::vector<typename Graph::Edge> incir;
     43  ///Vector containing the edges of the outer circle.
     44  std::vector<typename Graph::Edge> outcir;
     45  ///Vector containing the chord edges.
     46  std::vector<typename Graph::Edge> chords;
    4147};
    4248
     
    4652
    4753///Adds a Petersen graph to \c G.
    48 ///The nodes end edges will be listed in the return structure.
     54///\return The nodes end edges og the generated graph.
    4955
    5056template<typename Graph>
Note: See TracChangeset for help on using the changeset viewer.