COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Changeset 1993:2115143eceea in lemon-0.x


Ignore:
Timestamp:
03/01/06 14:19:28 (18 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2596
Message:

utility, invalid and traits moved to bits

Files:
3 added
3 deleted
50 edited

Legend:

Unmodified
Added
Removed

  • lemon/Makefile.am

    r1979 r1993  
    4646        graph_to_eps.h \
    4747        hypercube_graph.h \
    48         invalid.h \
    4948        iterable_maps.h \
    5049        johnson.h \
    … …  
    7574        time_measure.h \
    7675        topology.h \
    77         traits.h \
    7876        ugraph_adaptor.h \
    7977        unionfind.h \
    8078        xy.h \
    8179        concept_check.h \
    82         utility.h \
    8380        lemon_reader.h \
    8481        lemon_writer.h \
    … …  
    9592        bits/graph_adaptor_extender.h \
    9693        bits/edge_set_extender.h \
     94        bits/invalid.h \
    9795        bits/item_reader.h \
    9896        bits/item_writer.h \
     97        bits/traits.h \
     98        bits/utility.h \
    9999        concept/bpugraph.h \
    100100        concept/graph.h \

  • lemon/base.cc

    r1956 r1993  
    2121
    2222#include<lemon/tolerance.h>
    23 #include<lemon/invalid.h>
     23#include<lemon/bits/invalid.h>
    2424namespace lemon {
    2525

  • lemon/bellman_ford.h

    r1956 r1993  
    2626
    2727#include <lemon/list_graph.h>
    28 #include <lemon/invalid.h>
     28#include <lemon/bits/invalid.h>
    2929#include <lemon/error.h>
    3030#include <lemon/maps.h>

  • lemon/bfs.h

    r1956 r1993  
    2626#include <lemon/list_graph.h>
    2727#include <lemon/graph_utils.h>
    28 #include <lemon/invalid.h>
     28#include <lemon/bits/invalid.h>
    2929#include <lemon/error.h>
    3030#include <lemon/maps.h>

  • lemon/bits/graph_extender.h

    r1991 r1993  
    2020#define LEMON_GRAPH_EXTENDER_H
    2121
    22 #include <lemon/invalid.h>
     22#include <lemon/bits/invalid.h>
    2323#include <lemon/error.h>
    2424

  • lemon/bits/map_extender.h

    r1956 r1993  
    2222#include <iterator>
    2323
    24 #include <lemon/traits.h>
     24#include <lemon/bits/traits.h>
    2525
    2626///\file

  • lemon/bits/static_map.h

    r1979 r1993  
    2323#include <iostream>
    2424
    25 #include <lemon/utility.h>
     25#include <lemon/bits/utility.h>
    2626#include <lemon/bits/map_extender.h>
    2727#include <lemon/bits/alteration_notifier.h>

  • lemon/bits/vector_map.h

    r1956 r1993  
    2323#include <algorithm>
    2424
    25 #include <lemon/utility.h>
     25#include <lemon/bits/utility.h>
    2626#include <lemon/bits/map_extender.h>
    2727#include <lemon/bits/alteration_notifier.h>

  • lemon/color.h

    r1971 r1993  
    3131#include <cmath>
    3232
    33 #include<lemon/invalid.h>
     33#include<lemon/bits/invalid.h>
    3434#include<lemon/xy.h>
    3535#include<lemon/maps.h>

  • lemon/concept/bpugraph.h

    r1979 r1993  
    3030#include <lemon/concept/ugraph.h>
    3131
    32 #include <lemon/utility.h>
     32#include <lemon/bits/utility.h>
    3333
    3434namespace lemon {

  • lemon/concept/graph.h

    r1979 r1993  
    2424///\brief Declaration of Graph.
    2525
    26 #include <lemon/invalid.h>
    27 #include <lemon/utility.h>
     26#include <lemon/bits/invalid.h>
     27#include <lemon/bits/utility.h>
    2828#include <lemon/concept/maps.h>
    2929#include <lemon/concept_check.h>

  • lemon/concept/graph_component.h

    r1956 r1993  
    2525#define LEMON_CONCEPT_GRAPH_COMPONENT_H
    2626
    27 #include <lemon/invalid.h>
     27#include <lemon/bits/invalid.h>
    2828#include <lemon/concept/maps.h>
    2929

  • lemon/concept/heap.h

    r1956 r1993  
    2525#define LEMON_CONCEPT_HEAP_H
    2626
    27 #include <lemon/invalid.h>
     27#include <lemon/bits/invalid.h>
    2828
    2929namespace lemon {

  • lemon/concept/maps.h

    r1956 r1993  
    2020#define LEMON_CONCEPT_MAPS_H
    2121
    22 #include <lemon/utility.h>
     22#include <lemon/bits/utility.h>
    2323#include <lemon/concept_check.h>
    2424

  • lemon/concept/matrix_maps.h

    r1956 r1993  
    2020#define LEMON_CONCEPT_MATRIX_MAPS_H
    2121
    22 #include <lemon/utility.h>
     22#include <lemon/bits/utility.h>
    2323#include <lemon/concept_check.h>
    2424

  • lemon/concept/path.h

    r1956 r1993  
    2626#define LEMON_CONCEPT_PATH_H
    2727
    28 #include <lemon/invalid.h>
     28#include <lemon/bits/invalid.h>
    2929#include <lemon/concept_check.h>
    3030

  • lemon/concept/ugraph.h

    r1980 r1993  
    2727#include <lemon/concept/graph_component.h>
    2828#include <lemon/concept/graph.h>
    29 #include <lemon/utility.h>
     29#include <lemon/bits/utility.h>
    3030
    3131namespace lemon {

  • lemon/dag_shortest_path.h

    r1956 r1993  
    2626
    2727#include <lemon/list_graph.h>
    28 #include <lemon/invalid.h>
     28#include <lemon/bits/invalid.h>
    2929#include <lemon/error.h>
    3030#include <lemon/maps.h>

  • lemon/dfs.h

    r1981 r1993  
    2626#include <lemon/list_graph.h>
    2727#include <lemon/graph_utils.h>
    28 #include <lemon/invalid.h>
     28#include <lemon/bits/invalid.h>
    2929#include <lemon/error.h>
    3030#include <lemon/maps.h>

  • lemon/dijkstra.h

    r1988 r1993  
    2828#include <lemon/list_graph.h>
    2929#include <lemon/bin_heap.h>
    30 #include <lemon/invalid.h>
     30#include <lemon/bits/invalid.h>
    3131#include <lemon/error.h>
    3232#include <lemon/maps.h>

  • lemon/dimacs.h

    r1956 r1993  
    2424#include <vector>
    2525#include <lemon/maps.h>
    26 #include <lemon/invalid.h>
     26#include <lemon/bits/invalid.h>
    2727
    2828/// \ingroup dimacs_group

  • lemon/euler.h

    r1979 r1993  
    1717 */
    1818
    19 #include<lemon/invalid.h>
     19#include<lemon/bits/invalid.h>
    2020#include<lemon/topology.h>
    2121#include <list>

  • lemon/floyd_warshall.h

    r1956 r1993  
    2727#include <lemon/list_graph.h>
    2828#include <lemon/graph_utils.h>
    29 #include <lemon/invalid.h>
     29#include <lemon/bits/invalid.h>
    3030#include <lemon/error.h>
    3131#include <lemon/matrix_maps.h>

  • lemon/fredman_tarjan.h

    r1979 r1993  
    3131#include <lemon/fib_heap.h>
    3232#include <lemon/radix_sort.h>
    33 #include <lemon/invalid.h>
     33#include <lemon/bits/invalid.h>
    3434#include <lemon/error.h>
    3535#include <lemon/maps.h>
    36 #include <lemon/traits.h>
     36#include <lemon/bits/traits.h>
    3737#include <lemon/graph_utils.h>
    3838

  • lemon/full_graph.h

    r1987 r1993  
    2626
    2727
    28 #include <lemon/invalid.h>
    29 #include <lemon/utility.h>
     28#include <lemon/bits/invalid.h>
     29#include <lemon/bits/utility.h>
    3030
    3131

  • lemon/graph_adaptor.h

    r1991 r1993  
    2828///\author Marton Makai
    2929
    30 #include <lemon/invalid.h>
     30#include <lemon/bits/invalid.h>
    3131#include <lemon/maps.h>
    3232

  • lemon/graph_to_eps.h

    r1976 r1993  
    3131#include <cmath>
    3232
    33 #include<lemon/invalid.h>
     33#include<lemon/bits/invalid.h>
    3434#include<lemon/xy.h>
    3535#include<lemon/maps.h>

  • lemon/graph_utils.h

    r1992 r1993  
    2525#include <cmath>
    2626
    27 #include <lemon/invalid.h>
    28 #include <lemon/utility.h>
     27#include <lemon/bits/invalid.h>
     28#include <lemon/bits/utility.h>
    2929#include <lemon/maps.h>
    30 #include <lemon/traits.h>
     30#include <lemon/bits/traits.h>
    3131
    3232#include <lemon/bits/alteration_notifier.h>

  • lemon/grid_ugraph.h

    r1986 r1993  
    2121
    2222#include <iostream>
    23 #include <lemon/invalid.h>
    24 #include <lemon/utility.h>
     23#include <lemon/bits/invalid.h>
     24#include <lemon/bits/utility.h>
    2525
    2626#include <lemon/bits/graph_extender.h>

  • lemon/hypercube_graph.h

    r1986 r1993  
    2222#include <iostream>
    2323#include <vector>
    24 #include <lemon/invalid.h>
    25 #include <lemon/utility.h>
     24#include <lemon/bits/invalid.h>
     25#include <lemon/bits/utility.h>
    2626#include <lemon/error.h>
    2727

  • lemon/iterable_maps.h

    r1990 r1993  
    1717 */
    1818
    19 #include <lemon/traits.h>
    20 #include <lemon/invalid.h>
     19#include <lemon/bits/traits.h>
     20#include <lemon/bits/invalid.h>
    2121
    2222#include <lemon/bits/default_map.h>

  • lemon/johnson.h

    r1956 r1993  
    2929#include <lemon/dijkstra.h>
    3030#include <lemon/bellman_ford.h>
    31 #include <lemon/invalid.h>
     31#include <lemon/bits/invalid.h>
    3232#include <lemon/error.h>
    3333#include <lemon/maps.h>

  • lemon/kruskal.h

    r1979 r1993  
    2323#include <vector>
    2424#include <lemon/unionfind.h>
    25 #include <lemon/utility.h>
    26 #include <lemon/traits.h>
     25#include <lemon/bits/utility.h>
     26#include <lemon/bits/traits.h>
    2727
    2828/**

  • lemon/lemon_reader.h

    r1956 r1993  
    3636#include <lemon/error.h>
    3737#include <lemon/graph_utils.h>
    38 #include <lemon/utility.h>
     38#include <lemon/bits/utility.h>
    3939#include <lemon/bits/item_reader.h>
    4040

  • lemon/lemon_writer.h

    r1956 r1993  
    3333
    3434#include <lemon/error.h>
    35 #include <lemon/invalid.h>
     35#include <lemon/bits/invalid.h>
    3636#include <lemon/graph_utils.h>
    3737#include <lemon/bits/item_writer.h>
    38 #include <lemon/utility.h>
     38#include <lemon/bits/utility.h>
    3939#include <lemon/maps.h>
    4040#include <lemon/xy.h>

  • lemon/lp_base.h

    r1956 r1993  
    2525#include<cmath>
    2626
    27 #include<lemon/utility.h>
     27#include<lemon/bits/utility.h>
    2828#include<lemon/error.h>
    29 #include<lemon/invalid.h>
     29#include<lemon/bits/invalid.h>
    3030
    3131///\file

  • lemon/map_iterator.h

    r1956 r1993  
    2020#define LEMON_MAP_ITERATOR_H
    2121
    22 #include <lemon/traits.h>
    23 #include <lemon/utility.h>
     22#include <lemon/bits/traits.h>
     23#include <lemon/bits/utility.h>
    2424
    2525/// \ingroup gutils

  • lemon/maps.h

    r1956 r1993  
    2222#include <iterator>
    2323
    24 #include <lemon/utility.h>
    25 #include <lemon/traits.h>
     24#include <lemon/bits/utility.h>
     25#include <lemon/bits/traits.h>
    2626
    2727///\file

  • lemon/matrix_maps.h

    r1956 r1993  
    2222
    2323#include <vector>
    24 #include <lemon/utility.h>
     24#include <lemon/bits/utility.h>
    2525#include <lemon/maps.h>
    2626

  • lemon/max_matching.h

    r1956 r1993  
    2121
    2222#include <queue>
    23 #include <lemon/invalid.h>
     23#include <lemon/bits/invalid.h>
    2424#include <lemon/unionfind.h>
    2525#include <lemon/graph_utils.h>

  • lemon/min_cut.h

    r1975 r1993  
    2727#include <lemon/linear_heap.h>
    2828
    29 #include <lemon/invalid.h>
     29#include <lemon/bits/invalid.h>
    3030#include <lemon/error.h>
    3131#include <lemon/maps.h>

  • lemon/path.h

    r1956 r1993  
    4646#include <algorithm>
    4747
    48 #include <lemon/invalid.h>
     48#include <lemon/bits/invalid.h>
    4949
    5050namespace lemon {

  • lemon/preflow.h

    r1956 r1993  
    2424
    2525#include <lemon/error.h>
    26 #include <lemon/invalid.h>
     26#include <lemon/bits/invalid.h>
    2727#include <lemon/tolerance.h>
    2828#include <lemon/maps.h>

  • lemon/prim.h

    r1979 r1993  
    2626#include <lemon/list_graph.h>
    2727#include <lemon/bin_heap.h>
    28 #include <lemon/invalid.h>
     28#include <lemon/bits/invalid.h>
    2929#include <lemon/error.h>
    3030#include <lemon/maps.h>
    31 #include <lemon/traits.h>
     31#include <lemon/bits/traits.h>
    3232
    3333#include <lemon/concept/ugraph.h>

  • lemon/smart_graph.h

    r1979 r1993  
    2626#include <vector>
    2727
    28 #include <lemon/invalid.h>
     28#include <lemon/bits/invalid.h>
    2929
    3030#include <lemon/bits/graph_extender.h>
    3131
    32 #include <lemon/utility.h>
     32#include <lemon/bits/utility.h>
    3333#include <lemon/error.h>
    3434

  • lemon/ugraph_adaptor.h

    r1991 r1993  
    2828///\author Balazs Dezso
    2929
    30 #include <lemon/invalid.h>
     30#include <lemon/bits/invalid.h>
    3131#include <lemon/maps.h>
    3232
    3333#include <lemon/bits/graph_adaptor_extender.h>
    3434
    35 #include <lemon/traits.h>
     35#include <lemon/bits/traits.h>
    3636
    3737#include <iostream>

  • lemon/unionfind.h

    r1956 r1993  
    3030#include <algorithm>
    3131
    32 #include <lemon/invalid.h>
     32#include <lemon/bits/invalid.h>
    3333
    3434namespace lemon {

  • lemon/xy.h

    r1974 r1993  
    2121
    2222#include <iostream>
    23 #include <lemon/utility.h>
     23#include <lemon/bits/utility.h>
    2424
    2525///\ingroup misc

  • test/max_matching_test.cc

    r1956 r1993  
    2424
    2525#include "test_tools.h"
    26 #include <lemon/invalid.h>
    2726#include <lemon/list_graph.h>
    2827#include <lemon/max_matching.h>

  • test/test_tools.h

    r1956 r1993  
    2626#include <ctime>
    2727
    28 #include <lemon/invalid.h>
    2928#include <lemon/concept_check.h>
     29#include <lemon/concept/graph.h>
    3030
    3131using namespace lemon;
Note: See TracChangeset for help on using the changeset viewer.