graph_utils.dox
changeset 46 58557724a139
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/graph_utils.dox	Mon Feb 22 00:46:59 2010 +0100
     1.3 @@ -0,0 +1,48 @@
     1.4 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
     1.5 + *
     1.6 + * This file is a part of LEMON, a generic C++ optimization library.
     1.7 + *
     1.8 + * Copyright (C) 2003-2010
     1.9 + * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10 + * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11 + *
    1.12 + * Permission to use, modify and distribute this software is granted
    1.13 + * provided that this copyright notice appears in all copies. For
    1.14 + * precise terms see the accompanying LICENSE file.
    1.15 + *
    1.16 + * This software is provided "AS IS" with no warranty of any kind,
    1.17 + * express or implied, and with no claim as to its suitability for any
    1.18 + * purpose.
    1.19 + *
    1.20 + */
    1.21 +
    1.22 +namespace lemon {
    1.23 +/**
    1.24 +[PAGE]sec_graph_utilities[PAGE] Basic Graph Utilities
    1.25 +
    1.26 +\todo This page is under construction.
    1.27 +
    1.28 +
    1.29 +[SEC]sec_util_item_count[SEC] Count Graph Items
    1.30 +
    1.31 +See countNodes(), countArcs(), countEdges(),
    1.32 +countOutArcs(), countInArcs(), countIncEdges().
    1.33 +
    1.34 +
    1.35 +[SEC]sec_util_graph_copy[SEC] Copying a Graph
    1.36 +
    1.37 +See DigraphCopy and GraphCopy.
    1.38 +
    1.39 +
    1.40 +[SEC]sec_util_typedefs[SEC] Type Definitions
    1.41 +
    1.42 +See DIGRAPH_TYPEDEFS, GRAPH_TYPEDEFS and their TEMPLATE_* variants.
    1.43 +
    1.44 +
    1.45 +[SEC]sec_util_graph_maps[SEC] Special Graph Maps
    1.46 +
    1.47 +See \ref graph_maps in the reference manual.
    1.48 +
    1.49 +[TRAILER]
    1.50 +*/
    1.51 +}