source: lemon-tutorial/graph_utils.dox @ 49:c8c5a2a4ec71

/* -*- mode: C++; indent-tabs-mode: nil; -*-
 *
 * This file is a part of LEMON, a generic C++ optimization library.
 *
 * Copyright (C) 2003-2010
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
 *
 * Permission to use, modify and distribute this software is granted
 * provided that this copyright notice appears in all copies. For
 * precise terms see the accompanying LICENSE file.
 *
 * This software is provided "AS IS" with no warranty of any kind,
 * express or implied, and with no claim as to its suitability for any
 * purpose.
 *
 */

namespace lemon {
/**
[PAGE]sec_graph_utilities[PAGE] Basic Graph Utilities

\todo This page is under construction.


[SEC]sec_util_item_count[SEC] Count Graph Items

See countNodes(), countArcs(), countEdges(),
countOutArcs(), countInArcs(), countIncEdges().


[SEC]sec_util_graph_copy[SEC] Copying a Graph

See DigraphCopy and GraphCopy.


[SEC]sec_util_typedefs[SEC] Type Definitions

See DIGRAPH_TYPEDEFS, GRAPH_TYPEDEFS and their TEMPLATE_* variants.


[SEC]sec_util_graph_maps[SEC] Special Graph Maps

See \ref graph_maps in the reference manual.

[TRAILER]
*/
}