# Changeset 2376:0ed45a6c74b1 in lemon-0.x

Ignore:
Timestamp:
02/21/07 14:30:21 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3195
Message:

Reorganization of the modules and groups

Files:
16 edited

Unmodified
Removed
• ## doc/groups.dox

 r2371 */ /** @defgroup graphbits Tools to Make It Easier to Make Graphs @ingroup auxdat \brief Tools to Make It Easier to Make Graphs. This group describes the tools that makes it easier to make graphs and the maps that dynamically update with the graph changes. */ /** /** @defgroup gutils Basic Graph Utilities @ingroup algs \brief This group describes some simple basic graph utilities. This group describes some simple basic graph utilities. */ /** @defgroup flowalgs Path and Flow Algorithms @defgroup search Graph Search @ingroup algs \brief This group contains the common graph search algorithms. This group contains the common graph search algorithms like Bfs and Dfs. */ /** @defgroup shortest_path Shortest Path algorithms @ingroup algs \brief This group describes the algorithms for finding paths and flows in graphs. This group describes the algorithms for finding paths and flows in graphs. for finding shortest paths. This group describes the algorithms for finding shortest paths in graphs. */ /** @defgroup max_flow Maximum Flow algorithms @ingroup algs \brief This group describes the algorithms for finding maximum flows. This group describes the algorithms for finding maximum flows. \image html flow.png /** @defgroup min_cost_flow Minimum Cost Flow algorithms @ingroup algs \brief This group describes the algorithms for finding minimum cost flows and circulations. This group describes the algorithms for finding minimum cost flows and circulations. */ /** @defgroup min_cut Minimum Cut algorithms @ingroup algs \brief This group describes the algorithms for finding minimum cut in graphs. This group describes the algorithms for finding minimum cut in graphs. */ /** @defgroup topology Topology related algorithms @ingroup algs /** @defgroup matching Matching algorithms in graphs and bipartite graphs @defgroup matching Matching algorithms @ingroup algs \brief This group describes the algorithms /** @defgroup spantree Minimum Cost Spanning Tree Algorithms @defgroup spantree Minimum Spanning Tree algorithms @ingroup algs \brief This group contains the algorithms for finding a minimum cost spanning /** @defgroup auxalg Auxiliary Algorithms @defgroup auxalg Auxiliary algorithms @ingroup algs \brief Some algorithms implemented in LEMON. This group describes the algorithms in LEMON in order to make it easier to implement complex algorithms. */ /** @defgroup approx Approximation algorithms \brief Approximation algorithms Approximation and heuristic algorithms */ This group adds some helper tools to general optimization framework implemented in LEMON. */ /** @defgroup utils Tools and Utilities \brief Tools and Utilities for Programming in LEMON Tools and Utilities for Programming in LEMON */ /** @defgroup gutils Basic Graph Utilities @ingroup utils \brief This group describes some simple basic graph utilities. This group describes some simple basic graph utilities. */ /** @defgroup misc Miscellaneous Tools @ingroup utils Here you can find several useful tools for development, debugging and testing. */ /** /** @defgroup graphbits Tools for Graph Implementation @ingroup utils \brief Tools to Make It Easier to Make Graphs. This group describes the tools that makes it easier to make graphs and the maps that dynamically update with the graph changes. */ /** @defgroup exceptions Exceptions @ingroup utils This group contains the exceptions thrown by LEMON library */ /** @defgroup io_group Input-Output \brief Several Graph Input-Output methods */ /** @defgroup exceptions Exceptions This group contains the exceptions thrown by LEMON library */ /**
• ## lemon/bellman_ford.h

 r2362 #define LEMON_BELMANN_FORD_H /// \ingroup flowalgs /// \ingroup shortest_path /// \file /// \brief BellmanFord algorithm. /// \brief %BellmanFord algorithm class. /// /// \ingroup flowalgs /// \ingroup shortest_path /// This class provides an efficient implementation of \c Bellman-Ford /// algorithm. The edge lengths are passed to the algorithm using a /// \brief Function type interface for BellmanFord algorithm. /// /// \ingroup flowalgs /// \ingroup shortest_path /// Function type interface for BellmanFord algorithm. ///
• ## lemon/bfs.h

 r2350 #define LEMON_BFS_H ///\ingroup flowalgs ///\ingroup search ///\file ///\brief Bfs algorithm. ///%BFS algorithm class. ///\ingroup flowalgs ///\ingroup search ///This class provides an efficient implementation of the %BFS algorithm. /// ///Function type interface for Bfs algorithm. /// \ingroup flowalgs /// \ingroup search ///Function type interface for Bfs algorithm. /// /// %BFS Visit algorithm class. /// \ingroup flowalgs /// \ingroup search /// This class provides an efficient implementation of the %BFS algorithm /// with visitor interface.
• ## lemon/circulation.h

 r2375 #include ///\ingroup flowalgs ///\ingroup max_flow ///\file ///\brief Push-prelabel algorithm for finding a feasible circulation.
• ## lemon/csp.h

 r2373 #define LEMON_CSP_H ///\ingroup flowalgs ///\ingroup approx ///\file ///\brief Algorithm for the Resource Constrained Shortest Path problem.
• ## lemon/dfs.h

 r2335 #define LEMON_DFS_H ///\ingroup flowalgs ///\ingroup search ///\file ///\brief Dfs algorithm. ///%DFS algorithm class. ///\ingroup flowalgs ///\ingroup search ///This class provides an efficient implementation of the %DFS algorithm. /// ///Function type interface for Dfs algorithm. /// \ingroup flowalgs ///\ingroup search ///Function type interface for Dfs algorithm. /// /// %DFS Visit algorithm class. /// \ingroup flowalgs /// \ingroup search /// This class provides an efficient implementation of the %DFS algorithm /// with visitor interface.
• ## lemon/dijkstra.h

 r2358 #define LEMON_DIJKSTRA_H ///\ingroup flowalgs ///\ingroup shortest_path ///\file ///\brief Dijkstra algorithm. ///%Dijkstra algorithm class. /// \ingroup flowalgs /// \ingroup shortest_path ///This class provides an efficient implementation of %Dijkstra algorithm. ///The edge lengths are passed to the algorithm using a ///Function type interface for Dijkstra algorithm. /// \ingroup flowalgs /// \ingroup shortest_path ///Function type interface for Dijkstra algorithm. ///
• ## lemon/edmonds_karp.h

 r2151 /// \file /// \ingroup flowalgs /// \ingroup max_flow /// \brief Implementation of the Edmonds-Karp algorithm. namespace lemon { /// \ingroup flowalgs /// \ingroup max_flow /// \brief Edmonds-Karp algorithms class. ///
• ## lemon/floyd_warshall.h

 r2335 #define LEMON_FLOYD_WARSHALL_H ///\ingroup flowalgs ///\ingroup shortest_path /// \file /// \brief FloydWarshall algorithm. /// \brief %FloydWarshall algorithm class. /// /// \ingroup flowalgs /// \ingroup shortest_path /// This class provides an efficient implementation of \c Floyd-Warshall /// algorithm. The edge lengths are passed to the algorithm using a
• ## lemon/hao_orlin.h

 r2340 /// \file /// \ingroup flowalgs /// \ingroup min_cut /// \brief Implementation of the Hao-Orlin algorithm. /// namespace lemon { /// \ingroup flowalgs /// \ingroup min_cut /// /// \brief %Hao-Orlin algorithm to find a minimum cut in directed graphs.
• ## lemon/johnson.h

 r2335 #define LEMON_JOHNSON_H ///\ingroup flowalgs ///\ingroup shortest_path /// \file /// \brief Johnson algorithm. /// \brief %Johnson algorithm class. /// /// \ingroup flowalgs /// \ingroup shortest_path /// This class provides an efficient implementation of \c %Johnson /// algorithm. The edge lengths are passed to the algorithm using a
• ## lemon/matrix_maps.h

 r2305 ///"ReferenceMatrixMap". /// ///\warning Do not use this map type when the two item sets are ///equal or based on the same item set. /// ///\param _FirstContainer the desired type of first container. It is ///ususally a Graph type, but can be any type with alteration
• ## lemon/nagamochi_ibaraki.h

 r2337 /// \ingroup topology /// \ingroup min_cut /// \file /// \brief Maximum cardinality search and minimum cut in undirected }; /// \ingroup topology /// \ingroup search /// /// \brief Maximum Cardinality Search algorithm class. }; /// \ingroup topology /// \ingroup min_cut /// /// \brief Calculates the minimum cut in an undirected graph.
• ## lemon/preflow.h

 r2350 /// \file /// \ingroup flowalgs /// \ingroup max_flow /// \brief Implementation of the preflow algorithm. namespace lemon { ///\ingroup flowalgs ///\ingroup max_flow ///\brief %Preflow algorithms class. /// }; ///\ingroup flowalgs ///\ingroup max_flow ///\brief Function type interface for Preflow algorithm. ///
• ## lemon/ssp_min_cost_flow.h

 r2350 #define LEMON_MIN_COST_FLOW_H ///\ingroup flowalgs ///\ingroup min_cost_flow /// ///\file namespace lemon { /// \addtogroup flowalgs /// \addtogroup min_cost_flow /// @{
• ## lemon/suurballe.h

 r2335 namespace lemon { /// \addtogroup flowalgs /// \addtogroup shortest_path /// @{
Note: See TracChangeset for help on using the changeset viewer.