Changeset 2260:4274224f8a7d in lemon-0.x for lemon
- Timestamp:
- 10/24/06 19:19:16 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
- Location:
- lemon
- Files:
-
- 8 added
- 8 deleted
- 34 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/Makefile.am
r2229 r2260 122 122 concept_HEADERS += \ 123 123 lemon/concept_check.h \ 124 lemon/concept /bpugraph.h \125 lemon/concept /graph.h \126 lemon/concept /graph_components.h \127 lemon/concept /heap.h \128 lemon/concept /maps.h \129 lemon/concept /matrix_maps.h \130 lemon/concept /path.h \131 lemon/concept /ugraph.h124 lemon/concepts/bpugraph.h \ 125 lemon/concepts/graph.h \ 126 lemon/concepts/graph_components.h \ 127 lemon/concepts/heap.h \ 128 lemon/concepts/maps.h \ 129 lemon/concepts/matrix_maps.h \ 130 lemon/concepts/path.h \ 131 lemon/concepts/ugraph.h -
lemon/bellman_ford.h
r2151 r2260 93 93 /// 94 94 /// The type of the map that stores the edge lengths. 95 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.95 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 96 96 typedef _LengthMap LengthMap; 97 97 … … 111 111 /// The type of the map that stores the last 112 112 /// edges of the shortest paths. 113 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.113 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 114 114 /// 115 115 typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap; … … 126 126 /// 127 127 /// The type of the map that stores the dists of the nodes. 128 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.128 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 129 129 /// 130 130 typedef typename Graph::template NodeMap<typename _LengthMap::Value> … … 147 147 /// This class provides an efficient implementation of \c Bellman-Ford 148 148 /// algorithm. The edge lengths are passed to the algorithm using a 149 /// \ref concept ::ReadMap "ReadMap", so it is easy to change it to any149 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 150 150 /// kind of length. 151 151 /// … … 159 159 /// 160 160 /// The type of the length is determined by the 161 /// \ref concept ::ReadMap::Value "Value" of the length map.161 /// \ref concepts::ReadMap::Value "Value" of the length map. 162 162 /// 163 163 /// \param _Graph The graph type the algorithm runs on. The default value … … 165 165 /// BellmanFord, it is only passed to \ref BellmanFordDefaultTraits. 166 166 /// \param _LengthMap This read-only EdgeMap determines the lengths of the 167 /// edges. The default map type is \ref concept ::Graph::EdgeMap167 /// edges. The default map type is \ref concepts::Graph::EdgeMap 168 168 /// "Graph::EdgeMap<int>". The value of _LengthMap is not used directly 169 169 /// by BellmanFord, it is only passed to \ref BellmanFordDefaultTraits. … … 791 791 /// 792 792 /// The type of the map that stores the edge lengths. 793 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.793 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 794 794 typedef _LengthMap LengthMap; 795 795 … … 809 809 /// The type of the map that stores the last 810 810 /// edges of the shortest paths. 811 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.811 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 812 812 typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap; 813 813 … … 821 821 /// 822 822 /// The type of the map that stores the dists of the nodes. 823 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.823 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 824 824 typedef NullMap<typename Graph::Node, Value> DistMap; 825 825 /// \brief Instantiates a DistMap. -
lemon/bfs.h
r2151 r2260 48 48 ///The type of the map that stores the last 49 49 ///edges of the shortest paths. 50 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.50 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 51 51 /// 52 52 typedef typename Graph::template NodeMap<typename GR::Edge> PredMap; … … 63 63 64 64 ///The type of the map that indicates which nodes are processed. 65 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.65 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 66 66 ///\todo named parameter to set this type, function to read and write. 67 67 typedef NullMap<typename Graph::Node,bool> ProcessedMap; … … 82 82 83 83 ///The type of the map that indicates which nodes are reached. 84 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.84 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 85 85 ///\todo named parameter to set this type, function to read and write. 86 86 typedef typename Graph::template NodeMap<bool> ReachedMap; … … 97 97 98 98 ///The type of the map that stores the dists of the nodes. 99 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.99 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 100 100 /// 101 101 typedef typename Graph::template NodeMap<int> DistMap; … … 706 706 ///The type of the map that stores the last 707 707 ///edges of the shortest paths. 708 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.708 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 709 709 /// 710 710 typedef NullMap<typename Graph::Node,typename GR::Edge> PredMap; … … 726 726 727 727 ///The type of the map that indicates which nodes are processed. 728 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.728 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 729 729 ///\todo named parameter to set this type, function to read and write. 730 730 typedef NullMap<typename Graph::Node,bool> ProcessedMap; … … 745 745 746 746 ///The type of the map that indicates which nodes are reached. 747 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.747 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 748 748 ///\todo named parameter to set this type, function to read and write. 749 749 typedef typename Graph::template NodeMap<bool> ReachedMap; … … 760 760 761 761 ///The type of the map that stores the dists of the nodes. 762 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.762 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 763 763 /// 764 764 typedef NullMap<typename Graph::Node,int> DistMap; -
lemon/bits/array_map.h
r2202 r2260 25 25 #include <lemon/bits/alteration_notifier.h> 26 26 #include <lemon/concept_check.h> 27 #include <lemon/concept /maps.h>27 #include <lemon/concepts/maps.h> 28 28 29 29 /// \ingroup graphbits … … 142 142 template <typename CMap> 143 143 ArrayMap& operator=(const CMap& cmap) { 144 checkConcept<concept ::ReadMap<Key, _Value>, CMap>();144 checkConcept<concepts::ReadMap<Key, _Value>, CMap>(); 145 145 const typename Parent::Notifier* notifier = Parent::getNotifier(); 146 146 Item it; -
lemon/bits/base_extender.h
r2231 r2260 27 27 28 28 #include <lemon/concept_check.h> 29 #include <lemon/concept /maps.h>29 #include <lemon/concepts/maps.h> 30 30 31 31 ///\ingroup graphbits -
lemon/bits/debug_map.h
r2202 r2260 30 30 31 31 #include <lemon/concept_check.h> 32 #include <lemon/concept /maps.h>32 #include <lemon/concepts/maps.h> 33 33 34 34 ///\ingroup graphbits … … 187 187 template <typename CMap> 188 188 DebugMap& operator=(const CMap& cmap) { 189 checkConcept<concept ::ReadMap<Key, _Value>, CMap>();189 checkConcept<concepts::ReadMap<Key, _Value>, CMap>(); 190 190 const typename Parent::Notifier* notifier = Parent::getNotifier(); 191 191 Item it; -
lemon/bits/graph_extender.h
r2231 r2260 27 27 28 28 #include <lemon/concept_check.h> 29 #include <lemon/concept /maps.h>29 #include <lemon/concepts/maps.h> 30 30 31 31 ///\ingroup graphbits … … 1129 1129 template <typename CMap> 1130 1130 NodeMap& operator=(const CMap& cmap) { 1131 checkConcept<concept ::ReadMap<Node, _Value>, CMap>();1131 checkConcept<concepts::ReadMap<Node, _Value>, CMap>(); 1132 1132 aNodeMap = cmap; 1133 1133 bNodeMap = cmap; -
lemon/bits/map_extender.h
r2031 r2260 25 25 26 26 #include <lemon/concept_check.h> 27 #include <lemon/concept /maps.h>27 #include <lemon/concepts/maps.h> 28 28 29 29 ///\file … … 207 207 template <typename CMap> 208 208 SubMapExtender& operator=(const CMap& cmap) { 209 checkConcept<concept ::ReadMap<Key, Value>, CMap>();209 checkConcept<concepts::ReadMap<Key, Value>, CMap>(); 210 210 Item it; 211 211 for (graph.first(it); it != INVALID; graph.next(it)) { -
lemon/bits/vector_map.h
r2202 r2260 29 29 30 30 #include <lemon/concept_check.h> 31 #include <lemon/concept /maps.h>31 #include <lemon/concepts/maps.h> 32 32 33 33 ///\ingroup graphbits … … 134 134 template <typename CMap> 135 135 VectorMap& operator=(const CMap& cmap) { 136 checkConcept<concept ::ReadMap<Key, _Value>, CMap>();136 checkConcept<concepts::ReadMap<Key, _Value>, CMap>(); 137 137 const typename Parent::Notifier* notifier = Parent::getNotifier(); 138 138 Item it; -
lemon/color.h
r2230 r2260 101 101 ///number. The integer range is cyclically mapped to the provided set of colors. 102 102 /// 103 ///This is a true \ref concept ::ReferenceMap "reference map", so you can also103 ///This is a true \ref concepts::ReferenceMap "reference map", so you can also 104 104 ///change the actual colors. 105 105 -
lemon/dag_shortest_path.h
r2151 r2260 94 94 /// 95 95 /// The type of the map that stores the edge lengths. 96 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.96 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 97 97 typedef _LengthMap LengthMap; 98 98 … … 112 112 /// The type of the map that stores the last 113 113 /// edges of the shortest paths. 114 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.114 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 115 115 /// 116 116 typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap; … … 129 129 /// 130 130 /// The type of the map that stores the dists of the nodes. 131 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.131 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 132 132 /// 133 133 typedef typename Graph::template NodeMap<typename _LengthMap::Value> … … 206 206 /// 207 207 /// The type of the map that stores the edge lengths. 208 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.208 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 209 209 typedef _LengthMap LengthMap; 210 210 … … 224 224 /// The type of the map that stores the last 225 225 /// edges of the longest paths. 226 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.226 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 227 227 /// 228 228 typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap; … … 241 241 /// 242 242 /// The type of the map that stores the dists of the nodes. 243 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.243 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 244 244 /// 245 245 typedef typename Graph::template NodeMap<typename _LengthMap::Value> … … 263 263 /// This class provides an efficient implementation of a Dag sortest path 264 264 /// searching algorithm. The edge lengths are passed to the algorithm 265 /// using a \ref concept ::ReadMap "ReadMap", so it is easy to change it265 /// using a \ref concepts::ReadMap "ReadMap", so it is easy to change it 266 266 /// to any kind of length. 267 267 /// … … 269 269 /// 270 270 /// The type of the length is determined by the 271 /// \ref concept ::ReadMap::Value "Value" of the length map.271 /// \ref concepts::ReadMap::Value "Value" of the length map. 272 272 /// 273 273 /// \param _Graph The graph type the algorithm runs on. The default value … … 275 275 /// DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits. 276 276 /// \param _LengthMap This read-only EdgeMap determines the lengths of the 277 /// edges. The default map type is \ref concept ::Graph::EdgeMap277 /// edges. The default map type is \ref concepts::Graph::EdgeMap 278 278 /// "Graph::EdgeMap<int>". The value of _LengthMap is not used directly 279 279 /// by DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits. … … 812 812 /// 813 813 /// The type of the map that stores the edge lengths. 814 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.814 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 815 815 typedef _LengthMap LengthMap; 816 816 … … 830 830 /// The type of the map that stores the last 831 831 /// edges of the shortest paths. 832 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.832 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 833 833 typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap; 834 834 … … 842 842 /// 843 843 /// The type of the map that stores the dists of the nodes. 844 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.844 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 845 845 typedef NullMap<typename Graph::Node, Value> DistMap; 846 846 /// \brief Instantiates a DistMap. -
lemon/dfs.h
r2156 r2260 49 49 ///The type of the map that stores the last 50 50 ///edges of the %DFS paths. 51 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.51 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 52 52 /// 53 53 typedef typename Graph::template NodeMap<typename GR::Edge> PredMap; … … 65 65 66 66 ///The type of the map that indicates which nodes are processed. 67 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.67 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 68 68 ///\todo named parameter to set this type, function to read and write. 69 69 typedef NullMap<typename Graph::Node,bool> ProcessedMap; … … 84 84 85 85 ///The type of the map that indicates which nodes are reached. 86 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.86 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 87 87 ///\todo named parameter to set this type, function to read and write. 88 88 typedef typename Graph::template NodeMap<bool> ReachedMap; … … 99 99 100 100 ///The type of the map that stores the dists of the nodes. 101 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.101 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 102 102 /// 103 103 typedef typename Graph::template NodeMap<int> DistMap; … … 753 753 ///The type of the map that stores the last 754 754 ///edges of the %DFS paths. 755 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.755 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 756 756 /// 757 757 typedef NullMap<typename Graph::Node,typename GR::Edge> PredMap; … … 773 773 774 774 ///The type of the map that indicates which nodes are processed. 775 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.775 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 776 776 ///\todo named parameter to set this type, function to read and write. 777 777 typedef NullMap<typename Graph::Node,bool> ProcessedMap; … … 792 792 793 793 ///The type of the map that indicates which nodes are reached. 794 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.794 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 795 795 ///\todo named parameter to set this type, function to read and write. 796 796 typedef typename Graph::template NodeMap<bool> ReachedMap; … … 807 807 808 808 ///The type of the map that stores the dists of the nodes. 809 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.809 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 810 810 /// 811 811 typedef NullMap<typename Graph::Node,int> DistMap; … … 1169 1169 /// 1170 1170 /// The type of the map that indicates which nodes are reached. 1171 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.1171 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 1172 1172 /// \todo named parameter to set this type, function to read and write. 1173 1173 typedef typename Graph::template NodeMap<bool> ReachedMap; -
lemon/dijkstra.h
r2230 r2260 49 49 50 50 ///The type of the map that stores the edge lengths. 51 ///It must meet the \ref concept ::ReadMap "ReadMap" concept.51 ///It must meet the \ref concepts::ReadMap "ReadMap" concept. 52 52 typedef LM LengthMap; 53 53 //The type of the length of the edges. … … 87 87 ///The type of the map that stores the last 88 88 ///edges of the shortest paths. 89 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.89 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 90 90 /// 91 91 typedef typename Graph::template NodeMap<typename GR::Edge> PredMap; … … 103 103 104 104 ///The type of the map that stores whether a nodes is processed. 105 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.105 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 106 106 ///By default it is a NullMap. 107 107 ///\todo If it is set to a real map, … … 125 125 126 126 ///The type of the map that stores the dists of the nodes. 127 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.127 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 128 128 /// 129 129 typedef typename Graph::template NodeMap<typename LM::Value> DistMap; … … 143 143 ///This class provides an efficient implementation of %Dijkstra algorithm. 144 144 ///The edge lengths are passed to the algorithm using a 145 ///\ref concept ::ReadMap "ReadMap",145 ///\ref concepts::ReadMap "ReadMap", 146 146 ///so it is easy to change it to any kind of length. 147 147 /// 148 148 ///The type of the length is determined by the 149 ///\ref concept ::ReadMap::Value "Value" of the length map.149 ///\ref concepts::ReadMap::Value "Value" of the length map. 150 150 /// 151 151 ///It is also possible to change the underlying priority heap. … … 158 158 ///relatively time consuming process to compute the edge length if 159 159 ///it is necessary. The default map type is \ref 160 ///concept ::Graph::EdgeMap "Graph::EdgeMap<int>". The value160 ///concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value 161 161 ///of LM is not used directly by Dijkstra, it is only passed to \ref 162 162 ///DijkstraDefaultTraits. \param TR Traits class to set … … 820 820 821 821 ///The type of the map that stores the edge lengths. 822 ///It must meet the \ref concept ::ReadMap "ReadMap" concept.822 ///It must meet the \ref concepts::ReadMap "ReadMap" concept. 823 823 typedef LM LengthMap; 824 824 //The type of the length of the edges. … … 862 862 ///The type of the map that stores the last 863 863 ///edges of the shortest paths. 864 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.864 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 865 865 /// 866 866 typedef NullMap <typename GR::Node,typename GR::Edge> PredMap; … … 881 881 882 882 ///The type of the map that stores whether a nodes is processed. 883 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.883 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 884 884 ///By default it is a NullMap. 885 885 ///\todo If it is set to a real map, … … 903 903 904 904 ///The type of the map that stores the dists of the nodes. 905 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.905 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 906 906 /// 907 907 typedef NullMap<typename Graph::Node,typename LM::Value> DistMap; -
lemon/edge_set.h
r2224 r2260 239 239 /// 240 240 /// \param _Graph The type of the graph which shares its node set with 241 /// this class. Its interface must conform to the \ref concept ::Graph241 /// this class. Its interface must conform to the \ref concepts::Graph 242 242 /// "Graph" concept. 243 243 /// 244 244 /// In the edge extension and removing it conforms to the 245 /// \ref concept ::Graph "Graph" concept.245 /// \ref concepts::Graph "Graph" concept. 246 246 template <typename _Graph> 247 247 class ListEdgeSet : public EdgeSetExtender<ListEdgeSetBase<_Graph> > { … … 331 331 /// 332 332 /// \param _Graph The type of the graph which shares its node set with 333 /// this class. Its interface must conform to the \ref concept ::Graph333 /// this class. Its interface must conform to the \ref concepts::Graph 334 334 /// "Graph" concept. 335 335 /// 336 336 /// In the edge extension and removing it conforms to the 337 /// \ref concept ::UGraph "UGraph" concept.337 /// \ref concepts::UGraph "UGraph" concept. 338 338 template <typename _Graph> 339 339 class ListUEdgeSet … … 568 568 /// 569 569 /// \param _Graph The type of the graph which shares its node set with 570 /// this class. Its interface must conform to the \ref concept ::Graph570 /// this class. Its interface must conform to the \ref concepts::Graph 571 571 /// "Graph" concept. 572 572 /// 573 573 /// In the edge extension and removing it conforms to the 574 /// \ref concept ::Graph "Graph" concept.574 /// \ref concepts::Graph "Graph" concept. 575 575 template <typename _Graph> 576 576 class SmartEdgeSet : public EdgeSetExtender<SmartEdgeSetBase<_Graph> > { … … 672 672 /// 673 673 /// \param _Graph The type of the graph which shares its node set with 674 /// this class. Its interface must conform to the \ref concept ::Graph674 /// this class. Its interface must conform to the \ref concepts::Graph 675 675 /// "Graph" concept. 676 676 /// 677 677 /// In the edge extension and removing it conforms to the 678 /// \ref concept ::UGraph "UGraph" concept.678 /// \ref concepts::UGraph "UGraph" concept. 679 679 template <typename _Graph> 680 680 class SmartUEdgeSet -
lemon/floyd_warshall.h
r2184 r2260 95 95 /// 96 96 /// The type of the map that stores the edge lengths. 97 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.97 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 98 98 typedef _LengthMap LengthMap; 99 99 … … 130 130 /// 131 131 /// The type of the map that stores the dists of the nodes. 132 /// It must meet the \ref concept ::WriteMatrixMap "WriteMatrixMap" concept.132 /// It must meet the \ref concepts::WriteMatrixMap "WriteMatrixMap" concept. 133 133 /// 134 134 typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap; … … 150 150 /// This class provides an efficient implementation of \c Floyd-Warshall 151 151 /// algorithm. The edge lengths are passed to the algorithm using a 152 /// \ref concept ::ReadMap "ReadMap", so it is easy to change it to any152 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 153 153 /// kind of length. 154 154 /// … … 163 163 /// 164 164 /// The type of the length is determined by the 165 /// \ref concept ::ReadMap::Value "Value" of the length map.165 /// \ref concepts::ReadMap::Value "Value" of the length map. 166 166 /// 167 167 /// \param _Graph The graph type the algorithm runs on. The default value … … 172 172 /// relatively time consuming process to compute the edge length if 173 173 /// it is necessary. The default map type is \ref 174 /// concept ::Graph::EdgeMap "Graph::EdgeMap<int>". The value174 /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value 175 175 /// of _LengthMap is not used directly by FloydWarshall, it is only passed 176 176 /// to \ref FloydWarshallDefaultTraits. \param _Traits Traits class to set -
lemon/fredman_tarjan.h
r2151 r2260 37 37 #include <lemon/graph_utils.h> 38 38 39 #include <lemon/concept /ugraph.h>39 #include <lemon/concepts/ugraph.h> 40 40 41 41 namespace lemon { … … 53 53 54 54 ///The type of the map that stores the edge costs. 55 ///It must meet the \ref concept ::ReadMap "ReadMap" concept.55 ///It must meet the \ref concepts::ReadMap "ReadMap" concept. 56 56 typedef CM CostMap; 57 57 //The type of the cost of the edges. … … 62 62 ///The type of the map that stores whether an edge is in the 63 63 ///spanning tree or not. 64 ///It must meet the \ref concept ::ReadWriteMap "ReadWriteMap" concept.64 ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept. 65 65 ///By default it is a BoolEdgeMap. 66 66 typedef typename UGraph::template UEdgeMap<bool> TreeMap; … … 89 89 /// 90 90 ///The edge costs are passed to the algorithm using a \ref 91 ///concept ::ReadMap "ReadMap", so it is easy to change it to any91 ///concepts::ReadMap "ReadMap", so it is easy to change it to any 92 92 ///kind of cost. 93 93 /// 94 94 ///The type of the cost is determined by the \ref 95 ///concept ::ReadMap::Value "Value" of the cost map.95 ///concepts::ReadMap::Value "Value" of the cost map. 96 96 /// 97 97 ///\param GR The graph type the algorithm runs on. The default value … … 104 104 ///relatively time consuming process to compute the edge cost if it 105 105 ///is necessary. The default map type is \ref 106 ///concept ::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value of106 ///concepts::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value of 107 107 ///CM is not used directly by FredmanTarjan, it is only passed to 108 108 ///\ref FredmanTarjanDefaultTraits. … … 366 366 _tree(0), local_tree(false) 367 367 { 368 checkConcept<concept ::UGraph, UGraph>();368 checkConcept<concepts::UGraph, UGraph>(); 369 369 } 370 370 -
lemon/full_graph.h
r2256 r2260 168 168 /// edges or nodes. 169 169 /// Thus it conforms to 170 /// the \ref concept ::Graph "Graph" concept and170 /// the \ref concepts::Graph "Graph" concept and 171 171 ///it also has an 172 172 ///important extra feature that 173 ///its maps are real \ref concept ::ReferenceMap "reference map"s.174 /// \sa concept ::Graph.173 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 174 /// \sa concepts::Graph. 175 175 /// 176 176 /// \sa FullUGraph … … 385 385 ///It also has an 386 386 ///important extra feature that 387 ///its maps are real \ref concept ::ReferenceMap "reference map"s.387 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 388 388 /// 389 389 /// \sa FullGraph -
lemon/graph_adaptor.h
r2251 r2260 2493 2493 /// 2494 2494 /// This graph adaptor is fully conform to the 2495 /// \ref concept ::Graph "Graph" concept and2495 /// \ref concepts::Graph "Graph" concept and 2496 2496 /// contains some additional member functions and types. The 2497 2497 /// documentation of some member functions may be found just in the -
lemon/grid_ugraph.h
r2256 r2260 293 293 ///\endcode 294 294 /// 295 /// The graph type is fully conform to the \ref concept ::UGraph295 /// The graph type is fully conform to the \ref concepts::UGraph 296 296 /// "Undirected Graph" concept, and it also has an 297 297 ///important extra feature that 298 ///its maps are real \ref concept ::ReferenceMap "reference map"s.298 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 299 299 /// 300 300 /// -
lemon/hypercube_graph.h
r2242 r2260 190 190 /// is 26. 191 191 /// 192 /// The graph type is fully conform to the \ref concept ::Graph193 /// concept but it does not conform to the \ref concept ::UGraph.192 /// The graph type is fully conform to the \ref concepts::Graph 193 /// concept but it does not conform to the \ref concepts::UGraph. 194 194 /// 195 195 /// \author Balazs Dezso -
lemon/johnson.h
r2230 r2260 97 97 /// 98 98 /// The type of the map that stores the edge lengths. 99 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.99 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 100 100 typedef _LengthMap LengthMap; 101 101 … … 163 163 /// 164 164 /// The type of the matrix map that stores the dists of the nodes. 165 /// It must meet the \ref concept ::WriteMatrixMap "WriteMatrixMap" concept.165 /// It must meet the \ref concepts::WriteMatrixMap "WriteMatrixMap" concept. 166 166 /// 167 167 typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap; … … 183 183 /// This class provides an efficient implementation of \c %Johnson 184 184 /// algorithm. The edge lengths are passed to the algorithm using a 185 /// \ref concept ::ReadMap "ReadMap", so it is easy to change it to any185 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 186 186 /// kind of length. 187 187 /// … … 198 198 /// 199 199 /// The type of the length is determined by the 200 /// \ref concept ::ReadMap::Value "Value" of the length map.200 /// \ref concepts::ReadMap::Value "Value" of the length map. 201 201 /// 202 202 /// \param _Graph The graph type the algorithm runs on. The default value … … 207 207 /// relatively time consuming process to compute the edge length if 208 208 /// it is necessary. The default map type is \ref 209 /// concept ::Graph::EdgeMap "Graph::EdgeMap<int>". The value209 /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value 210 210 /// of _LengthMap is not used directly by Johnson, it is only passed 211 211 /// to \ref JohnsonDefaultTraits. \param _Traits Traits class to set -
lemon/kruskal.h
r2259 r2260 45 45 /// 46 46 /// \param g The graph the algorithm runs on. 47 /// It can be either \ref concept ::Graph "directed" or48 /// \ref concept ::UGraph "undirected".47 /// It can be either \ref concepts::Graph "directed" or 48 /// \ref concepts::UGraph "undirected". 49 49 /// If the graph is directed, the algorithm consider it to be 50 50 /// undirected by disregarding the direction of the edges. … … 84 84 /// 85 85 /// \warning If kruskal runs on an 86 /// \ref lemon::concept ::UGraph "undirected graph", be sure that the86 /// \ref lemon::concepts::UGraph "undirected graph", be sure that the 87 87 /// map storing the tree is also undirected 88 88 /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the -
lemon/lemon_reader.h
r2207 r2260 42 42 43 43 #include <lemon/concept_check.h> 44 #include <lemon/concept /maps.h>44 #include <lemon/concepts/maps.h> 45 45 46 46 namespace lemon { … … 832 832 NodeSetReader& _readMap(std::string name, MapParameter map, 833 833 const Reader& reader = Reader()) { 834 checkConcept<concept ::WriteMap<Node, typename Map::Value>, Map>();834 checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>(); 835 835 checkConcept<_reader_bits::ItemReader<typename Map::Value>, Reader>(); 836 836 if (readers.find(name) != readers.end()) { … … 1062 1062 EdgeSetReader& _readMap(std::string name, MapParameter map, 1063 1063 const Reader& reader = Reader()) { 1064 checkConcept<concept ::WriteMap<Edge, typename Map::Value>, Map>();1064 checkConcept<concepts::WriteMap<Edge, typename Map::Value>, Map>(); 1065 1065 checkConcept<_reader_bits::ItemReader<typename Map::Value>, Reader>(); 1066 1066 if (readers.find(name) != readers.end()) { … … 1306 1306 UEdgeSetReader& _readMap(std::string name, MapParameter map, 1307 1307 const Reader& reader = Reader()) { 1308 checkConcept<concept ::WriteMap<UEdge, typename Map::Value>, Map>();1308 checkConcept<concepts::WriteMap<UEdge, typename Map::Value>, Map>(); 1309 1309 checkConcept<_reader_bits::ItemReader<typename Map::Value>, Reader>(); 1310 1310 if (readers.find(name) != readers.end()) { … … 1377 1377 const Reader& reader = Reader()) { 1378 1378 checkConcept<_reader_bits::ItemReader<typename Map::Value>, Reader>(); 1379 checkConcept<concept ::WriteMap<Edge, typename Map::Value>, Map>();1379 checkConcept<concepts::WriteMap<Edge, typename Map::Value>, Map>(); 1380 1380 readMap("+" + name, 1381 1381 _reader_bits::forwardComposeMap(graph, map), reader); -
lemon/lemon_writer.h
r2207 r2260 41 41 42 42 #include <lemon/concept_check.h> 43 #include <lemon/concept /maps.h>43 #include <lemon/concepts/maps.h> 44 44 45 45 … … 484 484 NodeSetWriter& writeNodeMap(std::string name, const Map& map, 485 485 const Writer& writer = Writer()) { 486 checkConcept<concept ::ReadMap<Node, typename Map::Value>, Map>();486 checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>(); 487 487 checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>(); 488 488 writers.push_back( … … 673 673 EdgeSetWriter& writeEdgeMap(std::string name, const Map& map, 674 674 const Writer& writer = Writer()) { 675 checkConcept<concept ::ReadMap<Edge, typename Map::Value>, Map>();675 checkConcept<concepts::ReadMap<Edge, typename Map::Value>, Map>(); 676 676 checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>(); 677 677 writers.push_back( … … 879 879 UEdgeSetWriter& writeUEdgeMap(std::string name, const Map& map, 880 880 const Writer& writer = Writer()) { 881 checkConcept<concept ::ReadMap<UEdge, typename Map::Value>, Map>();881 checkConcept<concepts::ReadMap<UEdge, typename Map::Value>, Map>(); 882 882 checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>(); 883 883 writers.push_back( … … 902 902 UEdgeSetWriter& writeEdgeMap(std::string name, const Map& map, 903 903 const Writer& writer = Writer()) { 904 checkConcept<concept ::ReadMap<Edge, typename Map::Value>, Map>();904 checkConcept<concepts::ReadMap<Edge, typename Map::Value>, Map>(); 905 905 checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>(); 906 906 writeUEdge("+" + name, -
lemon/list_graph.h
r2256 r2260 319 319 ///This is a simple and fast graph implementation. 320 320 /// 321 ///It conforms to the \ref concept ::Graph "Graph concept" and it321 ///It conforms to the \ref concepts::Graph "Graph concept" and it 322 322 ///also provides several additional useful extra functionalities. 323 323 ///The most of the member functions and nested classes are … … 325 325 /// 326 326 ///An important extra feature of this graph implementation is that 327 ///its maps are real \ref concept ::ReferenceMap "reference map"s.327 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 328 328 /// 329 ///\sa concept ::Graph.329 ///\sa concepts::Graph. 330 330 331 331 class ListGraph : public ExtendedListGraphBase { … … 749 749 /// 750 750 ///An important extra feature of this graph implementation is that 751 ///its maps are real \ref concept ::ReferenceMap "reference map"s.751 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 752 752 /// 753 753 ///It conforms to the 754 ///\ref concept ::UGraph "UGraph concept".754 ///\ref concepts::UGraph "UGraph concept". 755 755 /// 756 ///\sa concept ::UGraph.756 ///\sa concepts::UGraph. 757 757 /// 758 758 class ListUGraph : public ExtendedListUGraphBase { … … 1498 1498 /// 1499 1499 /// This is a bipartite undirected graph implementation. 1500 /// It is conforms to the \ref concept ::BpUGraph "BpUGraph concept".1500 /// It is conforms to the \ref concepts::BpUGraph "BpUGraph concept". 1501 1501 /// 1502 1502 ///An important extra feature of this graph implementation is that 1503 ///its maps are real \ref concept ::ReferenceMap "reference map"s.1503 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 1504 1504 /// 1505 /// \sa concept ::BpUGraph.1505 /// \sa concepts::BpUGraph. 1506 1506 /// 1507 1507 class ListBpUGraph : public ExtendedListBpUGraphBase { -
lemon/lp_base.h
r2218 r2260 666 666 ///std::map<AnyType,LpSolverBase::Col> 667 667 ///\endcode 668 ///- an iterable lemon \ref concept ::WriteMap "write map" like668 ///- an iterable lemon \ref concepts::WriteMap "write map" like 669 669 ///\code 670 670 ///ListGraph::NodeMap<LpSolverBase::Col> … … 766 766 ///std::map<AnyType,LpSolverBase::Row> 767 767 ///\endcode 768 ///- an iterable lemon \ref concept ::WriteMap "write map" like768 ///- an iterable lemon \ref concepts::WriteMap "write map" like 769 769 ///\code 770 770 ///ListGraph::NodeMap<LpSolverBase::Row> -
lemon/maps.h
r2258 r2260 30 30 ///\brief Miscellaneous property maps 31 31 /// 32 ///\todo This file has the same name as the concept file in concept /,32 ///\todo This file has the same name as the concept file in concepts/, 33 33 /// and this is not easily detectable in docs... 34 34 … … 253 253 ///Convert the \c Value of a map to another type. 254 254 255 ///This \ref concept ::ReadMap "read only map"255 ///This \ref concepts::ReadMap "read only map" 256 256 ///converts the \c Value of a maps to type \c T. 257 257 ///Its \c Key is inherited from \c M. … … 290 290 ///Simple wrapping of the map 291 291 292 ///This \ref concept ::ReadMap "read only map" returns the simple292 ///This \ref concepts::ReadMap "read only map" returns the simple 293 293 ///wrapping of the given map. Sometimes the reference maps cannot be 294 294 ///combined with simple read maps. This map adaptor wraps the given … … 310 310 ///Simple writeable wrapping of the map 311 311 312 ///This \ref concept ::ReadMap "read only map" returns the simple312 ///This \ref concepts::ReadMap "read only map" returns the simple 313 313 ///wrapping of the given map. Sometimes the reference maps cannot be 314 314 ///combined with simple read-write maps. This map adaptor wraps the … … 331 331 ///Sum of two maps 332 332 333 ///This \ref concept ::ReadMap "read only map" returns the sum of the two333 ///This \ref concepts::ReadMap "read only map" returns the sum of the two 334 334 ///given maps. Its \c Key and \c Value will be inherited from \c M1. 335 335 ///The \c Key and \c Value of M2 must be convertible to those of \c M1. … … 364 364 ///Shift a map with a constant. 365 365 366 ///This \ref concept ::ReadMap "read only map" returns the sum of the366 ///This \ref concepts::ReadMap "read only map" returns the sum of the 367 367 ///given map and a constant value. 368 368 ///Its \c Key and \c Value is inherited from \c M. … … 397 397 ///Shift a map with a constant. 398 398 399 ///This \ref concept ::ReadWriteMap "read-write map" returns the sum of the399 ///This \ref concepts::ReadWriteMap "read-write map" returns the sum of the 400 400 ///given map and a constant value. It makes also possible to write the map. 401 401 ///Its \c Key and \c Value is inherited from \c M. … … 446 446 ///Difference of two maps 447 447 448 ///This \ref concept ::ReadMap "read only map" returns the difference448 ///This \ref concepts::ReadMap "read only map" returns the difference 449 449 ///of the values of the two 450 450 ///given maps. Its \c Key and \c Value will be inherited from \c M1. … … 477 477 ///Product of two maps 478 478 479 ///This \ref concept ::ReadMap "read only map" returns the product of the479 ///This \ref concepts::ReadMap "read only map" returns the product of the 480 480 ///values of the two 481 481 ///given … … 508 508 ///Scales a maps with a constant. 509 509 510 ///This \ref concept ::ReadMap "read only map" returns the value of the510 ///This \ref concepts::ReadMap "read only map" returns the value of the 511 511 ///given map multiplied from the left side with a constant value. 512 512 ///Its \c Key and \c Value is inherited from \c M. … … 541 541 ///Scales a maps with a constant. 542 542 543 ///This \ref concept ::ReadWriteMap "read-write map" returns the value of the543 ///This \ref concepts::ReadWriteMap "read-write map" returns the value of the 544 544 ///given map multiplied from the left side with a constant value. It can 545 545 ///be used as write map also if the given multiplier is not zero. … … 581 581 ///Quotient of two maps 582 582 583 ///This \ref concept ::ReadMap "read only map" returns the quotient of the583 ///This \ref concepts::ReadMap "read only map" returns the quotient of the 584 584 ///values of the two 585 585 ///given maps. Its \c Key and \c Value will be inherited from \c M1. … … 611 611 ///Composition of two maps 612 612 613 ///This \ref concept ::ReadMap "read only map" returns the composition of613 ///This \ref concepts::ReadMap "read only map" returns the composition of 614 614 ///two 615 615 ///given maps. That is to say, if \c m1 is of type \c M1 and \c m2 is … … 656 656 /// 657 657 /// 658 ///This \ref concept ::ReadMap "read only map" takes two maps and a658 ///This \ref concepts::ReadMap "read only map" takes two maps and a 659 659 ///binary functor and returns the composition of 660 660 ///the two … … 728 728 ///Negative value of a map 729 729 730 ///This \ref concept ::ReadMap "read only map" returns the negative730 ///This \ref concepts::ReadMap "read only map" returns the negative 731 731 ///value of the 732 732 ///value returned by the … … 749 749 ///Negative value of a map 750 750 751 ///This \ref concept ::ReadWriteMap "read-write map" returns the negative751 ///This \ref concepts::ReadWriteMap "read-write map" returns the negative 752 752 ///value of the value returned by the 753 753 ///given map. Its \c Key and \c Value will be inherited from \c M. … … 784 784 ///Absolute value of a map 785 785 786 ///This \ref concept ::ReadMap "read only map" returns the absolute value786 ///This \ref concepts::ReadMap "read only map" returns the absolute value 787 787 ///of the 788 788 ///value returned by the … … 833 833 ///Converts an STL style functor to a map 834 834 835 ///This \ref concept ::ReadMap "read only map" returns the value835 ///This \ref concepts::ReadMap "read only map" returns the value 836 836 ///of a 837 837 ///given map. … … 891 891 /// 892 892 ///For the sake of convenience it also works as 893 ///a ususal \ref concept ::ReadMap "readable map",893 ///a ususal \ref concepts::ReadMap "readable map", 894 894 ///i.e. <tt>operator[]</tt> and the \c Key and \c Value typedefs also exist. 895 895 … … 926 926 ///Applies all map setting operations to two maps 927 927 928 ///This map has two \ref concept ::ReadMap "readable map"928 ///This map has two \ref concepts::ReadMap "readable map" 929 929 ///parameters and each read request will be passed just to the 930 930 ///first map. This class is the just readable map type of the ForkWriteMap. … … 950 950 ///Applies all map setting operations to two maps 951 951 952 ///This map has two \ref concept ::WriteMap "writable map"952 ///This map has two \ref concepts::WriteMap "writable map" 953 953 ///parameters and each write request will be passed to both of them. 954 ///If \c M1 is also \ref concept ::ReadMap "readable",954 ///If \c M1 is also \ref concepts::ReadMap "readable", 955 955 ///then the read operations will return the 956 956 ///corresponding values of \c M1. … … 997 997 ///Logical 'not' of a map 998 998 999 ///This bool \ref concept ::ReadMap "read only map" returns the999 ///This bool \ref concepts::ReadMap "read only map" returns the 1000 1000 ///logical negation of 1001 1001 ///value returned by the … … 1018 1018 ///Logical 'not' of a map with writing possibility 1019 1019 1020 ///This bool \ref concept ::ReadWriteMap "read-write map" returns the1020 ///This bool \ref concepts::ReadWriteMap "read-write map" returns the 1021 1021 ///logical negation of value returned by the given map. When it is set, 1022 1022 ///the opposite value is set to the original map. -
lemon/matrix_maps.h
r2088 r2260 26 26 #include <lemon/maps.h> 27 27 28 #include <lemon/concept /matrix_maps.h>28 #include <lemon/concepts/matrix_maps.h> 29 29 30 30 /// \file … … 32 32 /// \brief Maps indexed with pairs of items. 33 33 /// 34 /// \todo This file has the same name as the concept file in concept /,34 /// \todo This file has the same name as the concept file in concepts/, 35 35 /// and this is not easily detectable in docs... 36 36 namespace lemon { … … 296 296 template <typename CMap> 297 297 DynamicMatrixMap& operator=(const CMap& _cmap){ 298 checkConcept<concept ::ReadMatrixMap<FirstKey, SecondKey, Value>, CMap>();298 checkConcept<concepts::ReadMatrixMap<FirstKey, SecondKey, Value>, CMap>(); 299 299 typename Parent::Notifier* notifier = Parent::getNotifier(); 300 300 Key first, second; … … 433 433 template <typename CMap> 434 434 DynamicSymMatrixMap& operator=(const CMap& _cmap){ 435 checkConcept<concept ::ReadMatrixMap<FirstKey, SecondKey, Value>, CMap>();435 checkConcept<concepts::ReadMatrixMap<FirstKey, SecondKey, Value>, CMap>(); 436 436 typename Parent::Notifier* notifier = Parent::getNotifier(); 437 437 Key first, second; … … 520 520 ///needed. 521 521 /// 522 ///This map meet with the concept ::ReferenceMatrixMap<typename K1,522 ///This map meet with the concepts::ReferenceMatrixMap<typename K1, 523 523 ///typename K2, typename V, typename R, typename CR> called as 524 524 ///"ReferenceMatrixMap". … … 861 861 template <typename CMap> 862 862 DynamicAsymMatrixMap& operator=(const CMap& _cdmap){ 863 checkConcept<concept ::ReadMatrixMap<FirstKey, SecondKey, Value>, CMap>();863 checkConcept<concepts::ReadMatrixMap<FirstKey, SecondKey, Value>, CMap>(); 864 864 const typename FirstKeyProxy::Notifier* notifierFirstKey = 865 865 _first_key_proxy.getNotifier(); -
lemon/min_cost_arborescence.h
r2259 r2260 46 46 /// 47 47 /// The type of the map that stores the edge costs. 48 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.48 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 49 49 typedef _CostMap CostMap; 50 50 … … 58 58 /// 59 59 /// The type of the map that stores which edges are in the arborescence. 60 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.60 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 61 61 /// Initially it will be set to false on each edge. After it 62 62 /// will set all arborescence edges once. … … 111 111 /// relatively time consuming process to compute the edge cost if 112 112 /// it is necessary. The default map type is \ref 113 /// concept ::Graph::EdgeMap "Graph::EdgeMap<int>". The value113 /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value 114 114 /// of _CostMap is not used directly by MinCostArborescence, 115 115 /// it is only passed to \ref MinCostArborescenceDefaultTraits. -
lemon/min_cut.h
r2225 r2260 68 68 /// 69 69 /// The type of the map that stores the edge capacities. 70 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.70 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 71 71 typedef _CapacityMap CapacityMap; 72 72 … … 114 114 /// 115 115 /// The type of the map that stores whether a nodes is processed. 116 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.116 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 117 117 /// By default it is a NullMap. 118 118 typedef NullMap<typename Graph::Node, bool> ProcessedMap; … … 135 135 /// 136 136 /// The type of the map that stores the cardinalities of the nodes. 137 /// It must meet the \ref concept ::WriteMap "WriteMap" concept.137 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. 138 138 typedef typename Graph::template NodeMap<Value> CardinalityMap; 139 139 … … 163 163 /// 164 164 /// The edge capacities are passed to the algorithm using a 165 /// \ref concept ::ReadMap "ReadMap", so it is easy to change it to any165 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 166 166 /// kind of capacity. 167 167 /// 168 168 /// The type of the capacity is determined by the \ref 169 /// concept ::ReadMap::Value "Value" of the capacity map.169 /// concepts::ReadMap::Value "Value" of the capacity map. 170 170 /// 171 171 /// It is also possible to change the underlying priority heap. … … 180 180 /// relatively time consuming process to compute the edge capacity if 181 181 /// it is necessary. The default map type is \ref 182 /// concept ::Graph::EdgeMap "Graph::EdgeMap<int>". The value182 /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value 183 183 /// of CapacityMap is not used directly by search algorithm, it is only 184 184 /// passed to \ref MaxCardinalitySearchDefaultTraits. … … 715 715 /// 716 716 /// The type of the map that stores the edge capacities. 717 /// It must meet the \ref concept ::ReadMap "ReadMap" concept.717 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. 718 718 typedef _CapacityMap CapacityMap; 719 719 -
lemon/prim.h
r2230 r2260 31 31 #include <lemon/bits/traits.h> 32 32 33 #include <lemon/concept /ugraph.h>33 #include <lemon/concepts/ugraph.h> 34 34 35 35 namespace lemon { … … 47 47 48 48 ///The type of the map that stores the edge costs. 49 ///It must meet the \ref concept ::ReadMap "ReadMap" concept.49 ///It must meet the \ref concepts::ReadMap "ReadMap" concept. 50 50 typedef CM CostMap; 51 51 //The type of the cost of the edges. … … 83 83 ///The type of the map that stores the last 84 84 ///edges of the minimum spanning tree. 85 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.85 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 86 86 /// 87 87 typedef typename UGraph::template NodeMap<typename GR::UEdge> PredMap; … … 114 114 115 115 ///The type of the map that stores whether a nodes is processed. 116 ///It must meet the \ref concept ::WriteMap "WriteMap" concept.116 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 117 117 ///By default it is a NodeMap<bool>. 118 118 typedef NullMap<typename UGraph::Node,bool> ProcessedMap; … … 141 141 /// 142 142 ///The edge costs are passed to the algorithm using a 143 ///\ref concept ::ReadMap "ReadMap",143 ///\ref concepts::ReadMap "ReadMap", 144 144 ///so it is easy to change it to any kind of cost. 145 145 /// 146 146 ///The type of the cost is determined by the 147 ///\ref concept ::ReadMap::Value "Value" of the cost map.147 ///\ref concepts::ReadMap::Value "Value" of the cost map. 148 148 /// 149 149 ///It is also possible to change the underlying priority heap. … … 157 157 ///relatively time consuming process to compute the edge cost if 158 158 ///it is necessary. The default map type is \ref 159 ///concept ::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value159 ///concepts::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value 160 160 ///of CM is not used directly by Prim, it is only passed to \ref 161 161 ///PrimDefaultTraits. … … 413 413 _heap(NULL), local_heap(false) 414 414 { 415 checkConcept<concept ::UGraph, UGraph>();415 checkConcept<concepts::UGraph, UGraph>(); 416 416 } 417 417 -
lemon/smart_graph.h
r2256 r2260 195 195 ///node and edge deletions</b>. 196 196 ///It conforms to 197 ///the \ref concept ::Graph "Graph concept" with an197 ///the \ref concepts::Graph "Graph concept" with an 198 198 ///important extra feature that 199 ///its maps are real \ref concept ::ReferenceMap "reference map"s.200 /// 201 ///\sa concept ::Graph.199 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 200 /// 201 ///\sa concepts::Graph. 202 202 /// 203 203 ///\author Alpar Juttner … … 381 381 /// node and edge deletions</b>. 382 382 /// Except from this it conforms to 383 /// the \ref concept ::UGraph "UGraph concept".383 /// the \ref concepts::UGraph "UGraph concept". 384 384 /// 385 385 ///It also has an 386 386 ///important extra feature that 387 ///its maps are real \ref concept ::ReferenceMap "reference map"s.388 /// 389 /// \sa concept ::UGraph.387 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 388 /// 389 /// \sa concepts::UGraph. 390 390 /// 391 391 /// \todo Snapshot hasn't been implemented yet. … … 763 763 /// that <b> it does not support node and edge deletions</b>. 764 764 /// Except from this it conforms to 765 /// the \ref concept ::BpUGraph "BpUGraph concept".765 /// the \ref concepts::BpUGraph "BpUGraph concept". 766 766 /// 767 767 ///It also has an 768 768 ///important extra feature that 769 ///its maps are real \ref concept ::ReferenceMap "reference map"s.770 /// 771 /// \sa concept ::BpUGraph.769 ///its maps are real \ref concepts::ReferenceMap "reference map"s. 770 /// 771 /// \sa concepts::BpUGraph. 772 772 /// 773 773 class SmartBpUGraph : public ExtendedSmartBpUGraphBase { -
lemon/topology.h
r2111 r2260 26 26 #include <lemon/maps.h> 27 27 28 #include <lemon/concept /graph.h>29 #include <lemon/concept /ugraph.h>28 #include <lemon/concepts/graph.h> 29 #include <lemon/concepts/ugraph.h> 30 30 #include <lemon/concept_check.h> 31 31 … … 54 54 template <typename UGraph> 55 55 bool connected(const UGraph& graph) { 56 checkConcept<concept ::UGraph, UGraph>();56 checkConcept<concepts::UGraph, UGraph>(); 57 57 typedef typename UGraph::NodeIt NodeIt; 58 58 if (NodeIt(graph) == INVALID) return true; … … 79 79 template <typename UGraph> 80 80 int countConnectedComponents(const UGraph &graph) { 81 checkConcept<concept ::UGraph, UGraph>();81 checkConcept<concepts::UGraph, UGraph>(); 82 82 typedef typename UGraph::Node Node; 83 83 typedef typename UGraph::Edge Edge; … … 127 127 template <class UGraph, class NodeMap> 128 128 int connectedComponents(const UGraph &graph, NodeMap &compMap) { 129 checkConcept<concept ::UGraph, UGraph>();129 checkConcept<concepts::UGraph, UGraph>(); 130 130 typedef typename UGraph::Node Node; 131 131 typedef typename UGraph::Edge Edge; 132 checkConcept<concept ::WriteMap<Node, int>, NodeMap>();132 checkConcept<concepts::WriteMap<Node, int>, NodeMap>(); 133 133 134 134 typedef NullMap<Node, Edge> PredMap; … … 245 245 template <typename Graph> 246 246 bool stronglyConnected(const Graph& graph) { 247 checkConcept<concept ::Graph, Graph>();247 checkConcept<concepts::Graph, Graph>(); 248 248 249 249 typedef typename Graph::Node Node; … … 303 303 template <typename Graph> 304 304 int countStronglyConnectedComponents(const Graph& graph) { 305 checkConcept<concept ::Graph, Graph>();305 checkConcept<concepts::Graph, Graph>(); 306 306 307 307 using namespace _topology_bits; … … 372 372 template <typename Graph, typename NodeMap> 373 373 int stronglyConnectedComponents(const Graph& graph, NodeMap& compMap) { 374 checkConcept<concept ::Graph, Graph>();374 checkConcept<concepts::Graph, Graph>(); 375 375 typedef typename Graph::Node Node; 376 376 typedef typename Graph::NodeIt NodeIt; 377 checkConcept<concept ::WriteMap<Node, int>, NodeMap>();377 checkConcept<concepts::WriteMap<Node, int>, NodeMap>(); 378 378 379 379 using namespace _topology_bits; … … 435 435 template <typename Graph, typename EdgeMap> 436 436 int stronglyConnectedCutEdges(const Graph& graph, EdgeMap& cutMap) { 437 checkConcept<concept ::Graph, Graph>();437 checkConcept<concepts::Graph, Graph>(); 438 438 typedef typename Graph::Node Node; 439 439 typedef typename Graph::Edge Edge; 440 440 typedef typename Graph::NodeIt NodeIt; 441 checkConcept<concept ::WriteMap<Edge, bool>, EdgeMap>();441 checkConcept<concepts::WriteMap<Edge, bool>, EdgeMap>(); 442 442 443 443 using namespace _topology_bits; … … 731 731 template <typename UGraph> 732 732 int countBiNodeConnectedComponents(const UGraph& graph) { 733 checkConcept<concept ::UGraph, UGraph>();733 checkConcept<concepts::UGraph, UGraph>(); 734 734 typedef typename UGraph::NodeIt NodeIt; 735 735 … … 775 775 int biNodeConnectedComponents(const UGraph& graph, 776 776 UEdgeMap& compMap) { 777 checkConcept<concept ::UGraph, UGraph>();777 checkConcept<concepts::UGraph, UGraph>(); 778 778 typedef typename UGraph::NodeIt NodeIt; 779 779 typedef typename UGraph::UEdge UEdge; 780 checkConcept<concept ::WriteMap<UEdge, int>, UEdgeMap>();780 checkConcept<concepts::WriteMap<UEdge, int>, UEdgeMap>(); 781 781 782 782 using namespace _topology_bits; … … 815 815 template <typename UGraph, typename NodeMap> 816 816 int biNodeConnectedCutNodes(const UGraph& graph, NodeMap& cutMap) { 817 checkConcept<concept ::UGraph, UGraph>();817 checkConcept<concepts::UGraph, UGraph>(); 818 818 typedef typename UGraph::Node Node; 819 819 typedef typename UGraph::NodeIt NodeIt; 820 checkConcept<concept ::WriteMap<Node, bool>, NodeMap>();820 checkConcept<concepts::WriteMap<Node, bool>, NodeMap>(); 821 821 822 822 using namespace _topology_bits; … … 1058 1058 template <typename UGraph> 1059 1059 int countBiEdgeConnectedComponents(const UGraph& graph) { 1060 checkConcept<concept ::UGraph, UGraph>();1060 checkConcept<concepts::UGraph, UGraph>(); 1061 1061 typedef typename UGraph::NodeIt NodeIt; 1062 1062 … … 1101 1101 template <typename UGraph, typename NodeMap> 1102 1102 int biEdgeConnectedComponents(const UGraph& graph, NodeMap& compMap) { 1103 checkConcept<concept ::UGraph, UGraph>();1103 checkConcept<concepts::UGraph, UGraph>(); 1104 1104 typedef typename UGraph::NodeIt NodeIt; 1105 1105 typedef typename UGraph::Node Node; 1106 checkConcept<concept ::WriteMap<Node, int>, NodeMap>();1106 checkConcept<concepts::WriteMap<Node, int>, NodeMap>(); 1107 1107 1108 1108 using namespace _topology_bits; … … 1142 1142 template <typename UGraph, typename UEdgeMap> 1143 1143 int biEdgeConnectedCutEdges(const UGraph& graph, UEdgeMap& cutMap) { 1144 checkConcept<concept ::UGraph, UGraph>();1144 checkConcept<concepts::UGraph, UGraph>(); 1145 1145 typedef typename UGraph::NodeIt NodeIt; 1146 1146 typedef typename UGraph::UEdge UEdge; 1147 checkConcept<concept ::WriteMap<UEdge, bool>, UEdgeMap>();1147 checkConcept<concepts::WriteMap<UEdge, bool>, UEdgeMap>(); 1148 1148 1149 1149 using namespace _topology_bits; … … 1206 1206 using namespace _topology_bits; 1207 1207 1208 checkConcept<concept ::Graph, Graph>();1209 checkConcept<concept ::WriteMap<typename Graph::Node, int>, NodeMap>();1208 checkConcept<concepts::Graph, Graph>(); 1209 checkConcept<concepts::WriteMap<typename Graph::Node, int>, NodeMap>(); 1210 1210 1211 1211 typedef typename Graph::Node Node; … … 1248 1248 using namespace _topology_bits; 1249 1249 1250 checkConcept<concept ::Graph, Graph>();1251 checkConcept<concept ::ReadWriteMap<typename Graph::Node, int>, NodeMap>();1250 checkConcept<concepts::Graph, Graph>(); 1251 checkConcept<concepts::ReadWriteMap<typename Graph::Node, int>, NodeMap>(); 1252 1252 1253 1253 typedef typename Graph::Node Node; … … 1291 1291 bool dag(const Graph& graph) { 1292 1292 1293 checkConcept<concept ::Graph, Graph>();1293 checkConcept<concepts::Graph, Graph>(); 1294 1294 1295 1295 typedef typename Graph::Node Node; … … 1332 1332 template <typename UGraph> 1333 1333 bool acyclic(const UGraph& graph) { 1334 checkConcept<concept ::UGraph, UGraph>();1334 checkConcept<concepts::UGraph, UGraph>(); 1335 1335 typedef typename UGraph::Node Node; 1336 1336 typedef typename UGraph::NodeIt NodeIt; … … 1365 1365 template <typename UGraph> 1366 1366 bool tree(const UGraph& graph) { 1367 checkConcept<concept ::UGraph, UGraph>();1367 checkConcept<concepts::UGraph, UGraph>(); 1368 1368 typedef typename UGraph::Node Node; 1369 1369 typedef typename UGraph::NodeIt NodeIt; … … 1403 1403 template<typename UGraph> 1404 1404 inline bool bipartite(const UGraph &graph){ 1405 checkConcept<concept ::UGraph, UGraph>();1405 checkConcept<concepts::UGraph, UGraph>(); 1406 1406 1407 1407 typedef typename UGraph::NodeIt NodeIt; … … 1440 1440 template<typename UGraph, typename NodeMap> 1441 1441 inline bool bipartitePartitions(const UGraph &graph, NodeMap &partMap){ 1442 checkConcept<concept ::UGraph, UGraph>();1442 checkConcept<concepts::UGraph, UGraph>(); 1443 1443 1444 1444 typedef typename UGraph::Node Node; -
lemon/vmap.h
r1978 r2260 60 60 }; 61 61 62 ///Makes a virtual map from a \ref concept ::ReadMap "ReadMap"62 ///Makes a virtual map from a \ref concepts::ReadMap "ReadMap" 63 63 template<class M, class K=typename M::Key,class V=typename M::Value> 64 64 class VReadMap : public VMapBase<K,V> … … 75 75 vReadMap(const M& m) {return VReadMap<M,K,V>(m);} 76 76 77 ///Makes a virtual map from a \ref concept ::WriteMap "WriteMap"77 ///Makes a virtual map from a \ref concepts::WriteMap "WriteMap" 78 78 template<class M, class K=typename M::Key,class V=typename M::Value> 79 79 class VWriteMap :public VMapBase<K,V> … … 90 90 vWriteMap(const M& m) {return VReadMap<M,K,V>(m);} 91 91 92 ///Makes a virtual map from a \ref concept ::ReadWriteMap "ReadWriteMap"92 ///Makes a virtual map from a \ref concepts::ReadWriteMap "ReadWriteMap" 93 93 template<class M, class K=typename M::Key,class V=typename M::Value> 94 94 class VReadWriteMap :public VMapBase<K,V>
Note: See TracChangeset
for help on using the changeset viewer.