# HG changeset patch # User alpar # Date 1087206474 0 # Node ID 1ea8162ce6385823d767879ae6aec8f0e237b8b0 # Parent 06a3cba90f9482f0cf7bad9ab267f3e350d0d921 doc diff -r 06a3cba90f94 -r 1ea8162ce638 src/work/Doxyfile --- a/src/work/Doxyfile Mon Jun 14 09:46:03 2004 +0000 +++ b/src/work/Doxyfile Mon Jun 14 09:47:54 2004 +0000 @@ -198,7 +198,7 @@ # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. -EXTRACT_PRIVATE = NO +EXTRACT_PRIVATE = YES # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. @@ -391,17 +391,27 @@ # directories like "/usr/src/myproject". Separate the files or directories # with spaces. -INPUT = ../hugo \ +INPUT = ../../doc/mainpage.dox \ + ../../doc/graphs.dox \ + ../../doc/maps.dox ../../doc/coding_style.dox \ + ../../doc/groups.dox \ + ../hugo \ ../hugo/skeletons \ ../test/test_tools.h \ klao/path.h \ + klao/debug.h \ jacint/max_flow.h \ jacint/max_matching.h \ marci/bfs_dfs.h \ marci/bfs_dfs_misc.h \ jacint/graph_gen.h \ marci/max_bipartite_matching.h \ - marci/bipartite_graph_wrapper.h + marci/bipartite_graph_wrapper.h \ + deba/map_registry.h \ + deba/map_defines.h \ + deba/array_map_factory.h \ + johanna/kruskal.h \ + # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp diff -r 06a3cba90f94 -r 1ea8162ce638 src/work/jacint/max_matching.h --- a/src/work/jacint/max_matching.h Mon Jun 14 09:46:03 2004 +0000 +++ b/src/work/jacint/max_matching.h Mon Jun 14 09:47:54 2004 +0000 @@ -25,7 +25,7 @@ ///resulting maximum matching can be attained by write-out functions ///\ref writeNMapNode, \ref writeNMapEdge or \ref writeEMapBool ///depending on the preferred container. - + /// ///The dual side of a mathcing is a map of the nodes to ///MaxMatching::pos_enum, having values D, A and C showing the ///Gallai-Edmonds decomposition of the graph. The nodes in D induce @@ -34,9 +34,9 @@ ///matching. This decomposition can be attained by calling \ref ///writePos after running the algorithm. Before subsequent runs, ///the function \ref resetPos() must be called. - + /// ///\param Graph The undirected graph type the algorithm runs on. - + /// ///\author Jacint Szabo template class MaxMatching { @@ -239,7 +239,8 @@ ///After calling any run methods of the class, and before calling ///\ref resetPos(), it writes the Gallai-Edmonds canonical - ///decomposition of the graph. \c map must be a node map of \ref pos_enum 's. + ///decomposition of the graph. \c map must be a node map + ///of \ref pos_enum 's. template void writePos (NMapEnum& map) const { NodeIt v; diff -r 06a3cba90f94 -r 1ea8162ce638 src/work/johanna/kruskal.h --- a/src/work/johanna/kruskal.h Mon Jun 14 09:46:03 2004 +0000 +++ b/src/work/johanna/kruskal.h Mon Jun 14 09:47:54 2004 +0000 @@ -6,6 +6,9 @@ #include #include +///\file +///\brief Kruskal's algorithm to compute a minimum cost tree + namespace hugo { /// Kruskal's algorithm to compute a minimum cost tree diff -r 06a3cba90f94 -r 1ea8162ce638 src/work/klao/path.h --- a/src/work/klao/path.h Mon Jun 14 09:46:03 2004 +0000 +++ b/src/work/klao/path.h Mon Jun 14 09:47:54 2004 +0000 @@ -227,7 +227,7 @@ * PathConcept) while the builder is active (after the first modifying * operation and until the commit()) the original Path is in a * "transitional" state (operations ot it have undefined result). But - * in the case of DirPath the original path is unchanged until the + * in the case of DirPath the original path remains unchanged until the * commit. However we don't recomend that you use this feature. */ class Builder {