COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search


Ignore:
Files:
6 deleted
5 edited

Legend:

Unmodified
Added
Removed

  • doc/CMakeLists.txt

    r633 r596  
    1515      COMMAND rm -rf gen-images
    1616      COMMAND mkdir gen-images
    17       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/bipartite_matching.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_matching.eps
    18       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/bipartite_partitions.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_partitions.eps
    19       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/connected_components.eps
    20       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/edge_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/edge_biconnected_components.eps
    2117      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/grid_graph.png ${CMAKE_CURRENT_SOURCE_DIR}/images/grid_graph.eps
    22       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/node_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/node_biconnected_components.eps
    2318      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_0.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_0.eps
    2419      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_1.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_1.eps
    … …  
    2621      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_3.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_3.eps
    2722      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_4.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_4.eps
    28       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/strongly_connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/strongly_connected_components.eps
    2923      COMMAND rm -rf html
    3024      COMMAND ${DOXYGEN_EXECUTABLE} Doxyfile
    … …  
    3428      COMMAND if exist gen-images rmdir /s /q gen-images
    3529      COMMAND mkdir gen-images
    36       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/bipartite_matching.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_matching.eps
    37       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/bipartite_partitions.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_partitions.eps
    38       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/connected_components.eps
    39       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/edge_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/edge_biconnected_components.eps
    40       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/grid_graph.png ${CMAKE_CURRENT_SOURCE_DIR}/images/grid_graph.eps
    41       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/node_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/node_biconnected_components.eps
    4230      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_0.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_0.eps
    4331      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_1.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_1.eps
    … …  
    4533      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_3.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_3.eps
    4634      COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/nodeshape_4.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_4.eps
    47       COMMAND ${GHOSTSCRIPT_EXECUTABLE} -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r18 -sOutputFile=gen-images/strongly_connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/strongly_connected_components.eps
    4835      COMMAND if exist html rmdir /s /q html
    4936      COMMAND ${DOXYGEN_EXECUTABLE} Doxyfile

  • doc/Makefile.am

    r634 r349  
    2222        nodeshape_4.eps
    2323
    24 DOC_EPS_IMAGES27 = \
    25         bipartite_matching.eps \
    26         bipartite_partitions.eps \
    27         connected_components.eps \
    28         edge_biconnected_components.eps \
    29         node_biconnected_components.eps \
    30         strongly_connected_components.eps
    31 
    3224DOC_EPS_IMAGES = \
    33         $(DOC_EPS_IMAGES18) \
    34         $(DOC_EPS_IMAGES27)
     25        $(DOC_EPS_IMAGES18)
    3526
    3627DOC_PNG_IMAGES = \
    … …  
    4839        if test ${gs_found} = yes; then \
    4940          $(GS_COMMAND) -sDEVICE=pngalpha -r18 -sOutputFile=$@ $<; \
    50         else \
    51           echo; \
    52           echo "Ghostscript not found."; \
    53           echo; \
    54           exit 1; \
    55         fi
    56 
    57 $(DOC_EPS_IMAGES27:%.eps=doc/gen-images/%.png): doc/gen-images/%.png: doc/images/%.eps
    58         -mkdir doc/gen-images
    59         if test ${gs_found} = yes; then \
    60           $(GS_COMMAND) -sDEVICE=pngalpha -r27 -sOutputFile=$@ $<; \
    6141        else \
    6242          echo; \

  • doc/groups.dox

    r633 r611  
    408408
    409409/**
    410 @defgroup graph_properties Connectivity and Other Graph Properties
     410@defgroup graph_prop Connectivity and Other Graph Properties
    411411@ingroup algs
    412412\brief Algorithms for discovering the graph properties

  • lemon/connectivity.h

    r633 r606  
    3333#include <functional>
    3434
    35 /// \ingroup graph_properties
     35/// \ingroup connectivity
    3636/// \file
    3737/// \brief Connectivity algorithms
    … …  
    4141namespace lemon {
    4242
    43   /// \ingroup graph_properties
     43  /// \ingroup connectivity
    4444  ///
    4545  /// \brief Check whether the given undirected graph is connected.
    … …  
    6464  }
    6565
    66   /// \ingroup graph_properties
     66  /// \ingroup connectivity
    6767  ///
    6868  /// \brief Count the number of connected components of an undirected graph
    … …  
    106106  }
    107107
    108   /// \ingroup graph_properties
     108  /// \ingroup connectivity
    109109  ///
    110110  /// \brief Find the connected components of an undirected graph
    111111  ///
    112112  /// Find the connected components of an undirected graph.
    113   ///
    114   /// \image html connected_components.png
    115   /// \image latex connected_components.eps "Connected components" width=\textwidth
    116113  ///
    117114  /// \param graph The graph. It must be undirected.
    … …  
    121118  /// set continuously.
    122119  /// \return The number of components
     120  ///
    123121  template <class Graph, class NodeMap>
    124122  int connectedComponents(const Graph &graph, NodeMap &compMap) {
    … …  
    230228
    231229
    232   /// \ingroup graph_properties
     230  /// \ingroup connectivity
    233231  ///
    234232  /// \brief Check whether the given directed graph is strongly connected.
    … …  
    288286  }
    289287
    290   /// \ingroup graph_properties
     288  /// \ingroup connectivity
    291289  ///
    292290  /// \brief Count the strongly connected components of a directed graph
    … …  
    352350  }
    353351
    354   /// \ingroup graph_properties
     352  /// \ingroup connectivity
    355353  ///
    356354  /// \brief Find the strongly connected components of a directed graph
    … …  
    364362  /// a lower.
    365363  ///
    366   /// \image html strongly_connected_components.png
    367   /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth
    368   ///
    369364  /// \param digraph The digraph.
    370365  /// \retval compMap A writable node map. The values will be set from 0 to
    … …  
    373368  /// will be set continuously.
    374369  /// \return The number of components
     370  ///
    375371  template <typename Digraph, typename NodeMap>
    376372  int stronglyConnectedComponents(const Digraph& digraph, NodeMap& compMap) {
    … …  
    421417  }
    422418
    423   /// \ingroup graph_properties
     419  /// \ingroup connectivity
    424420  ///
    425421  /// \brief Find the cut arcs of the strongly connected components.
    … …  
    705701  int countBiNodeConnectedComponents(const Graph& graph);
    706702
    707   /// \ingroup graph_properties
     703  /// \ingroup connectivity
    708704  ///
    709705  /// \brief Checks the graph is bi-node-connected.
    … …  
    720716  }
    721717
    722   /// \ingroup graph_properties
     718  /// \ingroup connectivity
    723719  ///
    724720  /// \brief Count the biconnected components.
    … …  
    755751  }
    756752
    757   /// \ingroup graph_properties
     753  /// \ingroup connectivity
    758754  ///
    759755  /// \brief Find the bi-node-connected components.
    … …  
    763759  /// relation on the undirected edges. Two undirected edge are in relationship
    764760  /// when they are on same circle.
    765   ///
    766   /// \image html node_biconnected_components.png
    767   /// \image latex node_biconnected_components.eps "bi-node-connected components" width=\textwidth
    768761  ///
    769762  /// \param graph The graph.
    … …  
    773766  /// will be set continuously.
    774767  /// \return The number of components.
     768  ///
    775769  template <typename Graph, typename EdgeMap>
    776770  int biNodeConnectedComponents(const Graph& graph,
    … …  
    800794  }
    801795
    802   /// \ingroup graph_properties
     796  /// \ingroup connectivity
    803797  ///
    804798  /// \brief Find the bi-node-connected cut nodes.
    … …  
    10301024  int countBiEdgeConnectedComponents(const Graph& graph);
    10311025
    1032   /// \ingroup graph_properties
     1026  /// \ingroup connectivity
    10331027  ///
    10341028  /// \brief Checks that the graph is bi-edge-connected.
    … …  
    10451039  }
    10461040
    1047   /// \ingroup graph_properties
     1041  /// \ingroup connectivity
    10481042  ///
    10491043  /// \brief Count the bi-edge-connected components.
    … …  
    10801074  }
    10811075
    1082   /// \ingroup graph_properties
     1076  /// \ingroup connectivity
    10831077  ///
    10841078  /// \brief Find the bi-edge-connected components.
    … …  
    10881082  /// relation on the nodes. Two nodes are in relationship when they are
    10891083  /// connected at least two edge-disjoint paths.
    1090   ///
    1091   /// \image html edge_biconnected_components.png
    1092   /// \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
    10931084  ///
    10941085  /// \param graph The graph.
    … …  
    10981089  /// will be set continuously.
    10991090  /// \return The number of components.
     1091  ///
    11001092  template <typename Graph, typename NodeMap>
    11011093  int biEdgeConnectedComponents(const Graph& graph, NodeMap& compMap) {
    … …  
    11241116  }
    11251117
    1126   /// \ingroup graph_properties
     1118  /// \ingroup connectivity
    11271119  ///
    11281120  /// \brief Find the bi-edge-connected cut edges.
    … …  
    11881180  }
    11891181
    1190   /// \ingroup graph_properties
     1182  /// \ingroup connectivity
    11911183  ///
    11921184  /// \brief Sort the nodes of a DAG into topolgical order.
    … …  
    12271219  }
    12281220
    1229   /// \ingroup graph_properties
     1221  /// \ingroup connectivity
    12301222  ///
    12311223  /// \brief Sort the nodes of a DAG into topolgical order.
    … …  
    12821274  }
    12831275
    1284   /// \ingroup graph_properties
     1276  /// \ingroup connectivity
    12851277  ///
    12861278  /// \brief Check that the given directed graph is a DAG.
    … …  
    13241316  }
    13251317
    1326   /// \ingroup graph_properties
     1318  /// \ingroup connectivity
    13271319  ///
    13281320  /// \brief Check that the given undirected graph is acyclic.
    … …  
    13581350  }
    13591351
    1360   /// \ingroup graph_properties
     1352  /// \ingroup connectivity
    13611353  ///
    13621354  /// \brief Check that the given undirected graph is tree.
    … …  
    14501442  }
    14511443
    1452   /// \ingroup graph_properties
     1444  /// \ingroup connectivity
    14531445  ///
    14541446  /// \brief Check if the given undirected graph is bipartite or not
    … …  
    14871479  }
    14881480
    1489   /// \ingroup graph_properties
     1481  /// \ingroup connectivity
    14901482  ///
    14911483  /// \brief Check if the given undirected graph is bipartite or not
    … …  
    14951487  /// During the execution, the \c partMap will be set as the two
    14961488  /// partitions of the graph.
    1497   ///
    1498   /// \image html bipartite_partitions.png
    1499   /// \image latex bipartite_partitions.eps "Bipartite partititions" width=\textwidth
    1500   ///
    15011489  /// \param graph The undirected graph.
    15021490  /// \retval partMap A writable bool map of nodes. It will be set as the

  • lemon/euler.h

    r633 r606  
    2525#include <list>
    2626
    27 /// \ingroup graph_properties
     27/// \ingroup graph_prop
    2828/// \file
    2929/// \brief Euler tour
    … …  
    3737  ///Euler iterator for digraphs.
    3838
    39   /// \ingroup graph_properties
     39  /// \ingroup graph_prop
    4040  ///This iterator converts to the \c Arc type of the digraph and using
    4141  ///operator ++, it provides an Euler tour of a \e directed
    … …  
    124124  ///Euler iterator for graphs.
    125125
    126   /// \ingroup graph_properties
     126  /// \ingroup graph_prop
    127127  ///This iterator converts to the \c Arc (or \c Edge)
    128128  ///type of the digraph and using
    … …  
    229229  ///Checks if the graph is Eulerian
    230230
    231   /// \ingroup graph_properties
     231  /// \ingroup graph_prop
    232232  ///Checks if the graph is Eulerian. It works for both directed and undirected
    233233  ///graphs.
Note: See TracChangeset for help on using the changeset viewer.