Changeset 1993:2115143eceea in lemon-0.x for lemon
- Timestamp:
- 03/01/06 14:19:28 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2596
- Location:
- lemon
- Files:
-
- 3 added
- 3 deleted
- 48 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/Makefile.am
r1979 r1993 46 46 graph_to_eps.h \ 47 47 hypercube_graph.h \ 48 invalid.h \49 48 iterable_maps.h \ 50 49 johnson.h \ … … 75 74 time_measure.h \ 76 75 topology.h \ 77 traits.h \78 76 ugraph_adaptor.h \ 79 77 unionfind.h \ 80 78 xy.h \ 81 79 concept_check.h \ 82 utility.h \83 80 lemon_reader.h \ 84 81 lemon_writer.h \ … … 95 92 bits/graph_adaptor_extender.h \ 96 93 bits/edge_set_extender.h \ 94 bits/invalid.h \ 97 95 bits/item_reader.h \ 98 96 bits/item_writer.h \ 97 bits/traits.h \ 98 bits/utility.h \ 99 99 concept/bpugraph.h \ 100 100 concept/graph.h \ -
lemon/base.cc
r1956 r1993 21 21 22 22 #include<lemon/tolerance.h> 23 #include<lemon/ invalid.h>23 #include<lemon/bits/invalid.h> 24 24 namespace lemon { 25 25 -
lemon/bellman_ford.h
r1956 r1993 26 26 27 27 #include <lemon/list_graph.h> 28 #include <lemon/ invalid.h>28 #include <lemon/bits/invalid.h> 29 29 #include <lemon/error.h> 30 30 #include <lemon/maps.h> -
lemon/bfs.h
r1956 r1993 26 26 #include <lemon/list_graph.h> 27 27 #include <lemon/graph_utils.h> 28 #include <lemon/ invalid.h>28 #include <lemon/bits/invalid.h> 29 29 #include <lemon/error.h> 30 30 #include <lemon/maps.h> -
lemon/bits/graph_extender.h
r1991 r1993 20 20 #define LEMON_GRAPH_EXTENDER_H 21 21 22 #include <lemon/ invalid.h>22 #include <lemon/bits/invalid.h> 23 23 #include <lemon/error.h> 24 24 -
lemon/bits/map_extender.h
r1956 r1993 22 22 #include <iterator> 23 23 24 #include <lemon/ traits.h>24 #include <lemon/bits/traits.h> 25 25 26 26 ///\file -
lemon/bits/static_map.h
r1979 r1993 23 23 #include <iostream> 24 24 25 #include <lemon/ utility.h>25 #include <lemon/bits/utility.h> 26 26 #include <lemon/bits/map_extender.h> 27 27 #include <lemon/bits/alteration_notifier.h> -
lemon/bits/vector_map.h
r1956 r1993 23 23 #include <algorithm> 24 24 25 #include <lemon/ utility.h>25 #include <lemon/bits/utility.h> 26 26 #include <lemon/bits/map_extender.h> 27 27 #include <lemon/bits/alteration_notifier.h> -
lemon/color.h
r1971 r1993 31 31 #include <cmath> 32 32 33 #include<lemon/ invalid.h>33 #include<lemon/bits/invalid.h> 34 34 #include<lemon/xy.h> 35 35 #include<lemon/maps.h> -
lemon/concept/bpugraph.h
r1979 r1993 30 30 #include <lemon/concept/ugraph.h> 31 31 32 #include <lemon/ utility.h>32 #include <lemon/bits/utility.h> 33 33 34 34 namespace lemon { -
lemon/concept/graph.h
r1979 r1993 24 24 ///\brief Declaration of Graph. 25 25 26 #include <lemon/ invalid.h>27 #include <lemon/ utility.h>26 #include <lemon/bits/invalid.h> 27 #include <lemon/bits/utility.h> 28 28 #include <lemon/concept/maps.h> 29 29 #include <lemon/concept_check.h> -
lemon/concept/graph_component.h
r1956 r1993 25 25 #define LEMON_CONCEPT_GRAPH_COMPONENT_H 26 26 27 #include <lemon/ invalid.h>27 #include <lemon/bits/invalid.h> 28 28 #include <lemon/concept/maps.h> 29 29 -
lemon/concept/heap.h
r1956 r1993 25 25 #define LEMON_CONCEPT_HEAP_H 26 26 27 #include <lemon/ invalid.h>27 #include <lemon/bits/invalid.h> 28 28 29 29 namespace lemon { -
lemon/concept/maps.h
r1956 r1993 20 20 #define LEMON_CONCEPT_MAPS_H 21 21 22 #include <lemon/ utility.h>22 #include <lemon/bits/utility.h> 23 23 #include <lemon/concept_check.h> 24 24 -
lemon/concept/matrix_maps.h
r1956 r1993 20 20 #define LEMON_CONCEPT_MATRIX_MAPS_H 21 21 22 #include <lemon/ utility.h>22 #include <lemon/bits/utility.h> 23 23 #include <lemon/concept_check.h> 24 24 -
lemon/concept/path.h
r1956 r1993 26 26 #define LEMON_CONCEPT_PATH_H 27 27 28 #include <lemon/ invalid.h>28 #include <lemon/bits/invalid.h> 29 29 #include <lemon/concept_check.h> 30 30 -
lemon/concept/ugraph.h
r1980 r1993 27 27 #include <lemon/concept/graph_component.h> 28 28 #include <lemon/concept/graph.h> 29 #include <lemon/ utility.h>29 #include <lemon/bits/utility.h> 30 30 31 31 namespace lemon { -
lemon/dag_shortest_path.h
r1956 r1993 26 26 27 27 #include <lemon/list_graph.h> 28 #include <lemon/ invalid.h>28 #include <lemon/bits/invalid.h> 29 29 #include <lemon/error.h> 30 30 #include <lemon/maps.h> -
lemon/dfs.h
r1981 r1993 26 26 #include <lemon/list_graph.h> 27 27 #include <lemon/graph_utils.h> 28 #include <lemon/ invalid.h>28 #include <lemon/bits/invalid.h> 29 29 #include <lemon/error.h> 30 30 #include <lemon/maps.h> -
lemon/dijkstra.h
r1988 r1993 28 28 #include <lemon/list_graph.h> 29 29 #include <lemon/bin_heap.h> 30 #include <lemon/ invalid.h>30 #include <lemon/bits/invalid.h> 31 31 #include <lemon/error.h> 32 32 #include <lemon/maps.h> -
lemon/dimacs.h
r1956 r1993 24 24 #include <vector> 25 25 #include <lemon/maps.h> 26 #include <lemon/ invalid.h>26 #include <lemon/bits/invalid.h> 27 27 28 28 /// \ingroup dimacs_group -
lemon/euler.h
r1979 r1993 17 17 */ 18 18 19 #include<lemon/ invalid.h>19 #include<lemon/bits/invalid.h> 20 20 #include<lemon/topology.h> 21 21 #include <list> -
lemon/floyd_warshall.h
r1956 r1993 27 27 #include <lemon/list_graph.h> 28 28 #include <lemon/graph_utils.h> 29 #include <lemon/ invalid.h>29 #include <lemon/bits/invalid.h> 30 30 #include <lemon/error.h> 31 31 #include <lemon/matrix_maps.h> -
lemon/fredman_tarjan.h
r1979 r1993 31 31 #include <lemon/fib_heap.h> 32 32 #include <lemon/radix_sort.h> 33 #include <lemon/ invalid.h>33 #include <lemon/bits/invalid.h> 34 34 #include <lemon/error.h> 35 35 #include <lemon/maps.h> 36 #include <lemon/ traits.h>36 #include <lemon/bits/traits.h> 37 37 #include <lemon/graph_utils.h> 38 38 -
lemon/full_graph.h
r1987 r1993 26 26 27 27 28 #include <lemon/ invalid.h>29 #include <lemon/ utility.h>28 #include <lemon/bits/invalid.h> 29 #include <lemon/bits/utility.h> 30 30 31 31 -
lemon/graph_adaptor.h
r1991 r1993 28 28 ///\author Marton Makai 29 29 30 #include <lemon/ invalid.h>30 #include <lemon/bits/invalid.h> 31 31 #include <lemon/maps.h> 32 32 -
lemon/graph_to_eps.h
r1976 r1993 31 31 #include <cmath> 32 32 33 #include<lemon/ invalid.h>33 #include<lemon/bits/invalid.h> 34 34 #include<lemon/xy.h> 35 35 #include<lemon/maps.h> -
lemon/graph_utils.h
r1992 r1993 25 25 #include <cmath> 26 26 27 #include <lemon/ invalid.h>28 #include <lemon/ utility.h>27 #include <lemon/bits/invalid.h> 28 #include <lemon/bits/utility.h> 29 29 #include <lemon/maps.h> 30 #include <lemon/ traits.h>30 #include <lemon/bits/traits.h> 31 31 32 32 #include <lemon/bits/alteration_notifier.h> -
lemon/grid_ugraph.h
r1986 r1993 21 21 22 22 #include <iostream> 23 #include <lemon/ invalid.h>24 #include <lemon/ utility.h>23 #include <lemon/bits/invalid.h> 24 #include <lemon/bits/utility.h> 25 25 26 26 #include <lemon/bits/graph_extender.h> -
lemon/hypercube_graph.h
r1986 r1993 22 22 #include <iostream> 23 23 #include <vector> 24 #include <lemon/ invalid.h>25 #include <lemon/ utility.h>24 #include <lemon/bits/invalid.h> 25 #include <lemon/bits/utility.h> 26 26 #include <lemon/error.h> 27 27 -
lemon/iterable_maps.h
r1990 r1993 17 17 */ 18 18 19 #include <lemon/ traits.h>20 #include <lemon/ invalid.h>19 #include <lemon/bits/traits.h> 20 #include <lemon/bits/invalid.h> 21 21 22 22 #include <lemon/bits/default_map.h> -
lemon/johnson.h
r1956 r1993 29 29 #include <lemon/dijkstra.h> 30 30 #include <lemon/bellman_ford.h> 31 #include <lemon/ invalid.h>31 #include <lemon/bits/invalid.h> 32 32 #include <lemon/error.h> 33 33 #include <lemon/maps.h> -
lemon/kruskal.h
r1979 r1993 23 23 #include <vector> 24 24 #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> 27 27 28 28 /** -
lemon/lemon_reader.h
r1956 r1993 36 36 #include <lemon/error.h> 37 37 #include <lemon/graph_utils.h> 38 #include <lemon/ utility.h>38 #include <lemon/bits/utility.h> 39 39 #include <lemon/bits/item_reader.h> 40 40 -
lemon/lemon_writer.h
r1956 r1993 33 33 34 34 #include <lemon/error.h> 35 #include <lemon/ invalid.h>35 #include <lemon/bits/invalid.h> 36 36 #include <lemon/graph_utils.h> 37 37 #include <lemon/bits/item_writer.h> 38 #include <lemon/ utility.h>38 #include <lemon/bits/utility.h> 39 39 #include <lemon/maps.h> 40 40 #include <lemon/xy.h> -
lemon/lp_base.h
r1956 r1993 25 25 #include<cmath> 26 26 27 #include<lemon/ utility.h>27 #include<lemon/bits/utility.h> 28 28 #include<lemon/error.h> 29 #include<lemon/ invalid.h>29 #include<lemon/bits/invalid.h> 30 30 31 31 ///\file -
lemon/map_iterator.h
r1956 r1993 20 20 #define LEMON_MAP_ITERATOR_H 21 21 22 #include <lemon/ traits.h>23 #include <lemon/ utility.h>22 #include <lemon/bits/traits.h> 23 #include <lemon/bits/utility.h> 24 24 25 25 /// \ingroup gutils -
lemon/maps.h
r1956 r1993 22 22 #include <iterator> 23 23 24 #include <lemon/ utility.h>25 #include <lemon/ traits.h>24 #include <lemon/bits/utility.h> 25 #include <lemon/bits/traits.h> 26 26 27 27 ///\file -
lemon/matrix_maps.h
r1956 r1993 22 22 23 23 #include <vector> 24 #include <lemon/ utility.h>24 #include <lemon/bits/utility.h> 25 25 #include <lemon/maps.h> 26 26 -
lemon/max_matching.h
r1956 r1993 21 21 22 22 #include <queue> 23 #include <lemon/ invalid.h>23 #include <lemon/bits/invalid.h> 24 24 #include <lemon/unionfind.h> 25 25 #include <lemon/graph_utils.h> -
lemon/min_cut.h
r1975 r1993 27 27 #include <lemon/linear_heap.h> 28 28 29 #include <lemon/ invalid.h>29 #include <lemon/bits/invalid.h> 30 30 #include <lemon/error.h> 31 31 #include <lemon/maps.h> -
lemon/path.h
r1956 r1993 46 46 #include <algorithm> 47 47 48 #include <lemon/ invalid.h>48 #include <lemon/bits/invalid.h> 49 49 50 50 namespace lemon { -
lemon/preflow.h
r1956 r1993 24 24 25 25 #include <lemon/error.h> 26 #include <lemon/ invalid.h>26 #include <lemon/bits/invalid.h> 27 27 #include <lemon/tolerance.h> 28 28 #include <lemon/maps.h> -
lemon/prim.h
r1979 r1993 26 26 #include <lemon/list_graph.h> 27 27 #include <lemon/bin_heap.h> 28 #include <lemon/ invalid.h>28 #include <lemon/bits/invalid.h> 29 29 #include <lemon/error.h> 30 30 #include <lemon/maps.h> 31 #include <lemon/ traits.h>31 #include <lemon/bits/traits.h> 32 32 33 33 #include <lemon/concept/ugraph.h> -
lemon/smart_graph.h
r1979 r1993 26 26 #include <vector> 27 27 28 #include <lemon/ invalid.h>28 #include <lemon/bits/invalid.h> 29 29 30 30 #include <lemon/bits/graph_extender.h> 31 31 32 #include <lemon/ utility.h>32 #include <lemon/bits/utility.h> 33 33 #include <lemon/error.h> 34 34 -
lemon/ugraph_adaptor.h
r1991 r1993 28 28 ///\author Balazs Dezso 29 29 30 #include <lemon/ invalid.h>30 #include <lemon/bits/invalid.h> 31 31 #include <lemon/maps.h> 32 32 33 33 #include <lemon/bits/graph_adaptor_extender.h> 34 34 35 #include <lemon/ traits.h>35 #include <lemon/bits/traits.h> 36 36 37 37 #include <iostream> -
lemon/unionfind.h
r1956 r1993 30 30 #include <algorithm> 31 31 32 #include <lemon/ invalid.h>32 #include <lemon/bits/invalid.h> 33 33 34 34 namespace lemon { -
lemon/xy.h
r1974 r1993 21 21 22 22 #include <iostream> 23 #include <lemon/ utility.h>23 #include <lemon/bits/utility.h> 24 24 25 25 ///\ingroup misc
Note: See TracChangeset
for help on using the changeset viewer.