1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
3 * This file is a part of LEMON, a generic C++ optimization library.
5 * Copyright (C) 2003-2010
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
21 [PAGE]sec_graph_utilities[PAGE] Basic Graph Utilities
23 \todo This page is under construction.
26 [SEC]sec_util_item_count[SEC] Count Graph Items
28 See countNodes(), countArcs(), countEdges(),
29 countOutArcs(), countInArcs(), countIncEdges().
32 [SEC]sec_util_graph_copy[SEC] Copying a Graph
34 See DigraphCopy and GraphCopy.
37 [SEC]sec_util_typedefs[SEC] Type Definitions
39 See DIGRAPH_TYPEDEFS, GRAPH_TYPEDEFS and their TEMPLATE_* variants.
42 [SEC]sec_util_graph_maps[SEC] Special Graph Maps
44 See \ref graph_maps in the reference manual.