equal
deleted
inserted
replaced
|
1 /* -*- mode: C++; indent-tabs-mode: nil; -*- |
|
2 * |
|
3 * This file is a part of LEMON, a generic C++ optimization library. |
|
4 * |
|
5 * Copyright (C) 2003-2010 |
|
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
|
7 * (Egervary Research Group on Combinatorial Optimization, EGRES). |
|
8 * |
|
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. |
|
12 * |
|
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 |
|
15 * purpose. |
|
16 * |
|
17 */ |
|
18 |
|
19 namespace lemon { |
|
20 /** |
|
21 [PAGE]sec_graph_utilities[PAGE] Basic Graph Utilities |
|
22 |
|
23 \todo This page is under construction. |
|
24 |
|
25 |
|
26 [SEC]sec_util_item_count[SEC] Count Graph Items |
|
27 |
|
28 See countNodes(), countArcs(), countEdges(), |
|
29 countOutArcs(), countInArcs(), countIncEdges(). |
|
30 |
|
31 |
|
32 [SEC]sec_util_graph_copy[SEC] Copying a Graph |
|
33 |
|
34 See DigraphCopy and GraphCopy. |
|
35 |
|
36 |
|
37 [SEC]sec_util_typedefs[SEC] Type Definitions |
|
38 |
|
39 See DIGRAPH_TYPEDEFS, GRAPH_TYPEDEFS and their TEMPLATE_* variants. |
|
40 |
|
41 |
|
42 [SEC]sec_util_graph_maps[SEC] Special Graph Maps |
|
43 |
|
44 See \ref graph_maps in the reference manual. |
|
45 |
|
46 [TRAILER] |
|
47 */ |
|
48 } |