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