COIN-OR::LEMON - Graph Library

Changeset 682:1ea8162ce638 in lemon-0.x


Ignore:
Timestamp:
06/14/04 11:47:54 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@930
Message:

doc

Location:
src/work
Files:
4 edited

Legend:

Unmodified
Added
Removed
  • src/work/Doxyfile

    r637 r682  
    199199# will be included in the documentation.
    200200
    201 EXTRACT_PRIVATE        = NO
     201EXTRACT_PRIVATE        = YES
    202202
    203203# If the EXTRACT_STATIC tag is set to YES all static members of a file
     
    392392# with spaces.
    393393
    394 INPUT                  = ../hugo \
     394INPUT                  = ../../doc/mainpage.dox \
     395                         ../../doc/graphs.dox \
     396                         ../../doc/maps.dox ../../doc/coding_style.dox \
     397                         ../../doc/groups.dox \
     398                         ../hugo \
    395399                         ../hugo/skeletons \
    396400                         ../test/test_tools.h \
    397401                         klao/path.h \
     402                         klao/debug.h \
    398403                         jacint/max_flow.h \
    399404                         jacint/max_matching.h \
     
    402407                         jacint/graph_gen.h \
    403408                         marci/max_bipartite_matching.h \
    404                          marci/bipartite_graph_wrapper.h
     409                         marci/bipartite_graph_wrapper.h \
     410                         deba/map_registry.h \
     411                         deba/map_defines.h \
     412                         deba/array_map_factory.h \
     413                         johanna/kruskal.h \
     414                         
    405415
    406416# If the value of the INPUT tag contains directories, you can use the
  • src/work/jacint/max_matching.h

    r586 r682  
    2626  ///\ref writeNMapNode, \ref writeNMapEdge or \ref writeEMapBool
    2727  ///depending on the preferred container.
    28 
     28  ///
    2929  ///The dual side of a mathcing is a map of the nodes to
    3030  ///MaxMatching::pos_enum, having values D, A and C showing the
     
    3535  ///writePos after running the algorithm. Before subsequent runs,
    3636  ///the function \ref resetPos() must be called.
    37 
     37  ///
    3838  ///\param Graph The undirected graph type the algorithm runs on.
    39 
     39  ///
    4040  ///\author Jacint Szabo 
    4141  template <typename Graph>
     
    240240    ///After calling any run methods of the class, and before calling
    241241    ///\ref resetPos(), it writes the Gallai-Edmonds canonical
    242     ///decomposition of the graph. \c map must be a node map of \ref pos_enum 's.
     242    ///decomposition of the graph. \c map must be a node map
     243    ///of \ref pos_enum 's.
    243244    template<typename NMapEnum>
    244245    void writePos (NMapEnum& map) const {
  • src/work/johanna/kruskal.h

    r394 r682  
    66#include <unionfind.h>
    77#include <for_each_macros.h>
     8
     9///\file
     10///\brief Kruskal's algorithm to compute a minimum cost tree
    811
    912namespace hugo {
  • src/work/klao/path.h

    r619 r682  
    228228     * operation and until the commit()) the original Path is in a
    229229     * "transitional" state (operations ot it have undefined result). But
    230      * in the case of DirPath the original path is unchanged until the
     230     * in the case of DirPath the original path remains unchanged until the
    231231     * commit. However we don't recomend that you use this feature.
    232232     */
Note: See TracChangeset for help on using the changeset viewer.