0
19
0
92
74
37
28
18
36
7
2
... | ... |
@@ -111,9 +111,7 @@ |
111 | 111 |
class NodeMap : public DGR::template NodeMap<V> { |
112 |
typedef typename DGR::template NodeMap<V> Parent; |
|
113 |
|
|
112 | 114 |
public: |
113 |
|
|
114 |
typedef typename DGR::template NodeMap<V> Parent; |
|
115 |
|
|
116 | 115 |
explicit NodeMap(const Adaptor& adaptor) |
117 | 116 |
: Parent(*adaptor._digraph) {} |
118 |
|
|
119 | 117 |
NodeMap(const Adaptor& adaptor, const V& value) |
... | ... |
@@ -136,9 +134,7 @@ |
136 | 134 |
class ArcMap : public DGR::template ArcMap<V> { |
135 |
typedef typename DGR::template ArcMap<V> Parent; |
|
136 |
|
|
137 | 137 |
public: |
138 |
|
|
139 |
typedef typename DGR::template ArcMap<V> Parent; |
|
140 |
|
|
141 | 138 |
explicit ArcMap(const DigraphAdaptorBase<DGR>& adaptor) |
142 | 139 |
: Parent(*adaptor._digraph) {} |
143 |
|
|
144 | 140 |
ArcMap(const DigraphAdaptorBase<DGR>& adaptor, const V& value) |
... | ... |
@@ -257,4 +253,5 @@ |
257 | 253 |
class NodeMap : public GR::template NodeMap<V> { |
254 |
typedef typename GR::template NodeMap<V> Parent; |
|
255 |
|
|
258 | 256 |
public: |
259 |
typedef typename GR::template NodeMap<V> Parent; |
|
260 | 257 |
explicit NodeMap(const GraphAdaptorBase<GR>& adapter) |
... | ... |
@@ -279,4 +276,5 @@ |
279 | 276 |
class ArcMap : public GR::template ArcMap<V> { |
277 |
typedef typename GR::template ArcMap<V> Parent; |
|
278 |
|
|
280 | 279 |
public: |
281 |
typedef typename GR::template ArcMap<V> Parent; |
|
282 | 280 |
explicit ArcMap(const GraphAdaptorBase<GR>& adapter) |
... | ... |
@@ -300,4 +298,5 @@ |
300 | 298 |
class EdgeMap : public GR::template EdgeMap<V> { |
299 |
typedef typename GR::template EdgeMap<V> Parent; |
|
300 |
|
|
301 | 301 |
public: |
302 |
typedef typename GR::template EdgeMap<V> Parent; |
|
303 | 302 |
explicit EdgeMap(const GraphAdaptorBase<GR>& adapter) |
... | ... |
@@ -323,5 +322,5 @@ |
323 | 322 |
class ReverseDigraphBase : public DigraphAdaptorBase<DGR> { |
323 |
typedef DigraphAdaptorBase<DGR> Parent; |
|
324 | 324 |
public: |
325 | 325 |
typedef DGR Digraph; |
326 |
typedef DigraphAdaptorBase<DGR> Parent; |
|
327 | 326 |
protected: |
... | ... |
@@ -376,2 +375,3 @@ |
376 | 375 |
#endif |
376 |
typedef DigraphAdaptorExtender<ReverseDigraphBase<DGR> > Parent; |
|
377 | 377 |
public: |
... | ... |
@@ -379,3 +379,2 @@ |
379 | 379 |
typedef DGR Digraph; |
380 |
typedef DigraphAdaptorExtender<ReverseDigraphBase<DGR> > Parent; |
|
381 | 380 |
protected: |
... | ... |
@@ -405,2 +404,3 @@ |
405 | 404 |
class SubDigraphBase : public DigraphAdaptorBase<DGR> { |
405 |
typedef DigraphAdaptorBase<DGR> Parent; |
|
406 | 406 |
public: |
... | ... |
@@ -411,3 +411,2 @@ |
411 | 411 |
typedef SubDigraphBase Adaptor; |
412 |
typedef DigraphAdaptorBase<DGR> Parent; |
|
413 | 412 |
protected: |
... | ... |
@@ -511,6 +510,7 @@ |
511 | 510 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> { |
511 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, ch>, |
|
512 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> Parent; |
|
513 |
|
|
512 | 514 |
public: |
513 | 515 |
typedef V Value; |
514 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, ch>, |
|
515 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> Parent; |
|
516 | 516 |
|
... | ... |
@@ -537,6 +537,7 @@ |
537 | 537 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> { |
538 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, ch>, |
|
539 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> Parent; |
|
540 |
|
|
538 | 541 |
public: |
539 | 542 |
typedef V Value; |
540 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, ch>, |
|
541 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> Parent; |
|
542 | 543 |
|
... | ... |
@@ -564,2 +565,3 @@ |
564 | 565 |
: public DigraphAdaptorBase<DGR> { |
566 |
typedef DigraphAdaptorBase<DGR> Parent; |
|
565 | 567 |
public: |
... | ... |
@@ -570,3 +572,2 @@ |
570 | 572 |
typedef SubDigraphBase Adaptor; |
571 |
typedef DigraphAdaptorBase<Digraph> Parent; |
|
572 | 573 |
protected: |
... | ... |
@@ -652,6 +653,7 @@ |
652 | 653 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> { |
654 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, false>, |
|
655 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> Parent; |
|
656 |
|
|
653 | 657 |
public: |
654 | 658 |
typedef V Value; |
655 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, false>, |
|
656 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> Parent; |
|
657 | 659 |
|
... | ... |
@@ -678,6 +680,7 @@ |
678 | 680 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> { |
681 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, false>, |
|
682 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> Parent; |
|
683 |
|
|
679 | 684 |
public: |
680 | 685 |
typedef V Value; |
681 |
typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, false>, |
|
682 |
LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> Parent; |
|
683 | 686 |
|
... | ... |
@@ -865,2 +868,3 @@ |
865 | 868 |
class SubGraphBase : public GraphAdaptorBase<GR> { |
869 |
typedef GraphAdaptorBase<GR> Parent; |
|
866 | 870 |
public: |
... | ... |
@@ -871,3 +875,2 @@ |
871 | 875 |
typedef SubGraphBase Adaptor; |
872 |
typedef GraphAdaptorBase<GR> Parent; |
|
873 | 876 |
protected: |
... | ... |
@@ -1018,6 +1021,7 @@ |
1018 | 1021 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> { |
1022 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, ch>, |
|
1023 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> Parent; |
|
1024 |
|
|
1019 | 1025 |
public: |
1020 | 1026 |
typedef V Value; |
1021 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, ch>, |
|
1022 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> Parent; |
|
1023 | 1027 |
|
... | ... |
@@ -1044,6 +1048,7 @@ |
1044 | 1048 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> { |
1049 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, ch>, |
|
1050 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> Parent; |
|
1051 |
|
|
1045 | 1052 |
public: |
1046 | 1053 |
typedef V Value; |
1047 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, ch>, |
|
1048 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> Parent; |
|
1049 | 1054 |
|
... | ... |
@@ -1070,6 +1075,7 @@ |
1070 | 1075 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> { |
1076 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, ch>, |
|
1077 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> Parent; |
|
1078 |
|
|
1071 | 1079 |
public: |
1072 | 1080 |
typedef V Value; |
1073 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, ch>, |
|
1074 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> Parent; |
|
1075 | 1081 |
|
... | ... |
@@ -1098,2 +1104,3 @@ |
1098 | 1104 |
: public GraphAdaptorBase<GR> { |
1105 |
typedef GraphAdaptorBase<GR> Parent; |
|
1099 | 1106 |
public: |
... | ... |
@@ -1104,3 +1111,2 @@ |
1104 | 1111 |
typedef SubGraphBase Adaptor; |
1105 |
typedef GraphAdaptorBase<GR> Parent; |
|
1106 | 1112 |
protected: |
... | ... |
@@ -1213,6 +1219,7 @@ |
1213 | 1219 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> { |
1220 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, false>, |
|
1221 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> Parent; |
|
1222 |
|
|
1214 | 1223 |
public: |
1215 | 1224 |
typedef V Value; |
1216 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, false>, |
|
1217 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> Parent; |
|
1218 | 1225 |
|
... | ... |
@@ -1239,6 +1246,7 @@ |
1239 | 1246 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> { |
1247 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, false>, |
|
1248 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> Parent; |
|
1249 |
|
|
1240 | 1250 |
public: |
1241 | 1251 |
typedef V Value; |
1242 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, false>, |
|
1243 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> Parent; |
|
1244 | 1252 |
|
... | ... |
@@ -1265,6 +1273,7 @@ |
1265 | 1273 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> { |
1274 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, false>, |
|
1275 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> Parent; |
|
1276 |
|
|
1266 | 1277 |
public: |
1267 | 1278 |
typedef V Value; |
1268 |
typedef SubMapExtender<SubGraphBase<GR, NF, EF, false>, |
|
1269 |
LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> Parent; |
|
1270 | 1279 |
|
... | ... |
@@ -1487,7 +1496,2 @@ |
1487 | 1496 |
#endif |
1488 |
public: |
|
1489 |
|
|
1490 |
typedef GR Digraph; |
|
1491 |
typedef NF NodeFilterMap; |
|
1492 |
|
|
1493 | 1497 |
typedef DigraphAdaptorExtender< |
... | ... |
@@ -1496,2 +1500,7 @@ |
1496 | 1500 |
|
1501 |
public: |
|
1502 |
|
|
1503 |
typedef GR Digraph; |
|
1504 |
typedef NF NodeFilterMap; |
|
1505 |
|
|
1497 | 1506 |
typedef typename Parent::Node Node; |
... | ... |
@@ -1550,5 +1559,2 @@ |
1550 | 1559 |
|
1551 |
public: |
|
1552 |
typedef GR Graph; |
|
1553 |
typedef NF NodeFilterMap; |
|
1554 | 1560 |
typedef GraphAdaptorExtender< |
... | ... |
@@ -1557,3 +1563,9 @@ |
1557 | 1563 |
|
1564 |
public: |
|
1565 |
|
|
1566 |
typedef GR Graph; |
|
1567 |
typedef NF NodeFilterMap; |
|
1568 |
|
|
1558 | 1569 |
typedef typename Parent::Node Node; |
1570 |
|
|
1559 | 1571 |
protected: |
... | ... |
@@ -1631,3 +1643,8 @@ |
1631 | 1643 |
#endif |
1644 |
typedef DigraphAdaptorExtender< |
|
1645 |
SubDigraphBase<DGR, ConstMap<typename DGR::Node, Const<bool, true> >, |
|
1646 |
AF, false> > Parent; |
|
1647 |
|
|
1632 | 1648 |
public: |
1649 |
|
|
1633 | 1650 |
/// The type of the adapted digraph. |
... | ... |
@@ -1637,6 +1654,2 @@ |
1637 | 1654 |
|
1638 |
typedef DigraphAdaptorExtender< |
|
1639 |
SubDigraphBase<DGR, ConstMap<typename DGR::Node, Const<bool, true> >, |
|
1640 |
AF, false> > Parent; |
|
1641 |
|
|
1642 | 1655 |
typedef typename Parent::Arc Arc; |
... | ... |
@@ -1740,3 +1753,8 @@ |
1740 | 1753 |
#endif |
1754 |
typedef GraphAdaptorExtender< |
|
1755 |
SubGraphBase<GR, ConstMap<typename GR::Node, Const<bool, true > >, |
|
1756 |
EF, false> > Parent; |
|
1757 |
|
|
1741 | 1758 |
public: |
1759 |
|
|
1742 | 1760 |
/// The type of the adapted graph. |
... | ... |
@@ -1746,6 +1764,2 @@ |
1746 | 1764 |
|
1747 |
typedef GraphAdaptorExtender< |
|
1748 |
SubGraphBase<GR, ConstMap<typename GR::Node, Const<bool, true > >, |
|
1749 |
EF, false> > Parent; |
|
1750 |
|
|
1751 | 1765 |
typedef typename Parent::Edge Edge; |
... | ... |
@@ -2113,6 +2127,6 @@ |
2113 | 2127 |
class NodeMap : public DGR::template NodeMap<V> { |
2128 |
typedef typename DGR::template NodeMap<V> Parent; |
|
2129 |
|
|
2114 | 2130 |
public: |
2115 |
|
|
2116 | 2131 |
typedef V Value; |
2117 |
typedef typename DGR::template NodeMap<Value> Parent; |
|
2118 | 2132 |
|
... | ... |
@@ -2139,7 +2153,7 @@ |
2139 | 2153 |
class ArcMap |
2140 |
: public SubMapExtender<UndirectorBase<DGR>, ArcMapBase<V> > |
|
2141 |
{ |
|
2154 |
: public SubMapExtender<UndirectorBase<DGR>, ArcMapBase<V> > { |
|
2155 |
typedef SubMapExtender<UndirectorBase<DGR>, ArcMapBase<V> > Parent; |
|
2156 |
|
|
2142 | 2157 |
public: |
2143 | 2158 |
typedef V Value; |
2144 |
typedef SubMapExtender<Adaptor, ArcMapBase<V> > Parent; |
|
2145 | 2159 |
|
... | ... |
@@ -2165,6 +2179,6 @@ |
2165 | 2179 |
class EdgeMap : public Digraph::template ArcMap<V> { |
2180 |
typedef typename Digraph::template ArcMap<V> Parent; |
|
2181 |
|
|
2166 | 2182 |
public: |
2167 |
|
|
2168 | 2183 |
typedef V Value; |
2169 |
typedef typename Digraph::template ArcMap<V> Parent; |
|
2170 | 2184 |
|
... | ... |
@@ -2240,2 +2254,3 @@ |
2240 | 2254 |
#endif |
2255 |
typedef GraphAdaptorExtender<UndirectorBase<DGR> > Parent; |
|
2241 | 2256 |
public: |
... | ... |
@@ -2243,3 +2258,2 @@ |
2243 | 2258 |
typedef DGR Digraph; |
2244 |
typedef GraphAdaptorExtender<UndirectorBase<DGR> > Parent; |
|
2245 | 2259 |
protected: |
... | ... |
@@ -2451,6 +2465,6 @@ |
2451 | 2465 |
class NodeMap : public GR::template NodeMap<V> { |
2466 |
typedef typename GR::template NodeMap<V> Parent; |
|
2467 |
|
|
2452 | 2468 |
public: |
2453 | 2469 |
|
2454 |
typedef typename GR::template NodeMap<V> Parent; |
|
2455 |
|
|
2456 | 2470 |
explicit NodeMap(const OrienterBase<GR, DM>& adapter) |
... | ... |
@@ -2476,6 +2490,6 @@ |
2476 | 2490 |
class ArcMap : public GR::template EdgeMap<V> { |
2491 |
typedef typename Graph::template EdgeMap<V> Parent; |
|
2492 |
|
|
2477 | 2493 |
public: |
2478 | 2494 |
|
2479 |
typedef typename Graph::template EdgeMap<V> Parent; |
|
2480 |
|
|
2481 | 2495 |
explicit ArcMap(const OrienterBase<GR, DM>& adapter) |
... | ... |
@@ -2548,2 +2562,3 @@ |
2548 | 2562 |
#endif |
2563 |
typedef DigraphAdaptorExtender<OrienterBase<GR, DM> > Parent; |
|
2549 | 2564 |
public: |
... | ... |
@@ -2555,6 +2570,7 @@ |
2555 | 2570 |
|
2556 |
typedef DigraphAdaptorExtender<OrienterBase<GR, DM> > Parent; |
|
2557 | 2571 |
typedef typename Parent::Arc Arc; |
2572 |
|
|
2558 | 2573 |
protected: |
2559 | 2574 |
Orienter() { } |
2575 |
|
|
2560 | 2576 |
public: |
... | ... |
@@ -2868,2 +2884,4 @@ |
2868 | 2884 |
class SplitNodesBase { |
2885 |
typedef DigraphAdaptorBase<const DGR> Parent; |
|
2886 |
|
|
2869 | 2887 |
public: |
... | ... |
@@ -2871,3 +2889,2 @@ |
2871 | 2889 |
typedef DGR Digraph; |
2872 |
typedef DigraphAdaptorBase<const DGR> Parent; |
|
2873 | 2890 |
typedef SplitNodesBase Adaptor; |
... | ... |
@@ -3230,7 +3247,7 @@ |
3230 | 3247 |
class NodeMap |
3231 |
: public SubMapExtender<SplitNodesBase<DGR>, NodeMapBase<V> > |
|
3232 |
{ |
|
3248 |
: public SubMapExtender<SplitNodesBase<DGR>, NodeMapBase<V> > { |
|
3249 |
typedef SubMapExtender<SplitNodesBase<DGR>, NodeMapBase<V> > Parent; |
|
3250 |
|
|
3233 | 3251 |
public: |
3234 | 3252 |
typedef V Value; |
3235 |
typedef SubMapExtender<SplitNodesBase<DGR>, NodeMapBase<Value> > Parent; |
|
3236 | 3253 |
|
... | ... |
@@ -3256,7 +3273,7 @@ |
3256 | 3273 |
class ArcMap |
3257 |
: public SubMapExtender<SplitNodesBase<DGR>, ArcMapBase<V> > |
|
3258 |
{ |
|
3274 |
: public SubMapExtender<SplitNodesBase<DGR>, ArcMapBase<V> > { |
|
3275 |
typedef SubMapExtender<SplitNodesBase<DGR>, ArcMapBase<V> > Parent; |
|
3276 |
|
|
3259 | 3277 |
public: |
3260 | 3278 |
typedef V Value; |
3261 |
typedef SubMapExtender<SplitNodesBase<DGR>, ArcMapBase<Value> > Parent; |
|
3262 | 3279 |
|
... | ... |
@@ -3326,5 +3343,6 @@ |
3326 | 3343 |
#endif |
3344 |
typedef DigraphAdaptorExtender<SplitNodesBase<const DGR> > Parent; |
|
3345 |
|
|
3327 | 3346 |
public: |
3328 | 3347 |
typedef DGR Digraph; |
3329 |
typedef DigraphAdaptorExtender<SplitNodesBase<const DGR> > Parent; |
|
3330 | 3348 |
... | ... |
@@ -49,3 +49,3 @@ |
49 | 49 |
// The graph type. |
50 |
typedef _Graph |
|
50 |
typedef _Graph GraphType; |
|
51 | 51 |
// The item type. |
... | ... |
@@ -65,2 +65,5 @@ |
65 | 65 |
|
66 |
// The map type. |
|
67 |
typedef ArrayMap Map; |
|
68 |
|
|
66 | 69 |
// The notifier type. |
... | ... |
@@ -68,2 +71,4 @@ |
68 | 71 |
|
72 |
private: |
|
73 |
|
|
69 | 74 |
// The MapBase of the Map which imlements the core regisitry function. |
... | ... |
@@ -71,3 +76,2 @@ |
71 | 76 |
|
72 |
private: |
|
73 | 77 |
typedef std::allocator<Value> Allocator; |
... | ... |
@@ -79,3 +83,3 @@ |
79 | 83 |
// Graph initialized map constructor. |
80 |
explicit ArrayMap(const |
|
84 |
explicit ArrayMap(const GraphType& graph) { |
|
81 | 85 |
Parent::attach(graph.notifier(Item())); |
... | ... |
@@ -93,3 +97,3 @@ |
93 | 97 |
// It constructs a map and initialize all of the the map. |
94 |
ArrayMap(const |
|
98 |
ArrayMap(const GraphType& graph, const Value& value) { |
|
95 | 99 |
Parent::attach(graph.notifier(Item())); |
... | ... |
@@ -40,2 +40,3 @@ |
40 | 40 |
class UndirDigraphExtender : public Base { |
41 |
typedef Base Parent; |
|
41 | 42 |
|
... | ... |
@@ -43,3 +44,2 @@ |
43 | 44 |
|
44 |
typedef Base Parent; |
|
45 | 45 |
typedef typename Parent::Arc Edge; |
... | ... |
@@ -282,4 +282,5 @@ |
282 | 282 |
class BidirBpGraphExtender : public Base { |
283 |
typedef Base Parent; |
|
284 |
|
|
283 | 285 |
public: |
284 |
typedef Base Parent; |
|
285 | 286 |
typedef BidirBpGraphExtender Digraph; |
... | ... |
@@ -155,11 +155,12 @@ |
155 | 155 |
: public DefaultMapSelector<_Graph, _Item, _Value>::Map { |
156 |
typedef typename DefaultMapSelector<_Graph, _Item, _Value>::Map Parent; |
|
157 |
|
|
156 | 158 |
public: |
157 |
typedef typename DefaultMapSelector<_Graph, _Item, _Value>::Map Parent; |
|
158 | 159 |
typedef DefaultMap<_Graph, _Item, _Value> Map; |
159 |
|
|
160 |
typedef typename Parent::Graph Graph; |
|
160 |
|
|
161 |
typedef typename Parent::GraphType GraphType; |
|
161 | 162 |
typedef typename Parent::Value Value; |
162 | 163 |
|
163 |
explicit DefaultMap(const Graph& graph) : Parent(graph) {} |
|
164 |
DefaultMap(const Graph& graph, const Value& value) |
|
164 |
explicit DefaultMap(const GraphType& graph) : Parent(graph) {} |
|
165 |
DefaultMap(const GraphType& graph, const Value& value) |
|
165 | 166 |
: Parent(graph, value) {} |
... | ... |
@@ -36,5 +36,6 @@ |
36 | 36 |
class ArcSetExtender : public Base { |
37 |
typedef Base Parent; |
|
38 |
|
|
37 | 39 |
public: |
38 | 40 |
|
39 |
typedef Base Parent; |
|
40 | 41 |
typedef ArcSetExtender Digraph; |
... | ... |
@@ -220,6 +221,5 @@ |
220 | 221 |
: public MapExtender<DefaultMap<Digraph, Arc, _Value> > { |
221 |
public: |
|
222 |
typedef ArcSetExtender Digraph; |
|
223 | 222 |
typedef MapExtender<DefaultMap<Digraph, Arc, _Value> > Parent; |
224 | 223 |
|
224 |
public: |
|
225 | 225 |
explicit ArcMap(const Digraph& _g) |
... | ... |
@@ -276,2 +276,3 @@ |
276 | 276 |
class EdgeSetExtender : public Base { |
277 |
typedef Base Parent; |
|
277 | 278 |
|
... | ... |
@@ -279,4 +280,3 @@ |
279 | 280 |
|
280 |
typedef Base Parent; |
|
281 |
typedef EdgeSetExtender Digraph; |
|
281 |
typedef EdgeSetExtender Graph; |
|
282 | 282 |
|
... | ... |
@@ -286,3 +286,2 @@ |
286 | 286 |
|
287 |
|
|
288 | 287 |
int maxId(Node) const { |
... | ... |
@@ -352,3 +351,3 @@ |
352 | 351 |
class NodeIt : public Node { |
353 |
const |
|
352 |
const Graph* graph; |
|
354 | 353 |
public: |
... | ... |
@@ -359,3 +358,3 @@ |
359 | 358 |
|
360 |
explicit NodeIt(const |
|
359 |
explicit NodeIt(const Graph& _graph) : graph(&_graph) { |
|
361 | 360 |
_graph.first(static_cast<Node&>(*this)); |
... | ... |
@@ -363,7 +362,7 @@ |
363 | 362 |
|
364 |
NodeIt(const Digraph& _graph, const Node& node) |
|
365 |
: Node(node), digraph(&_graph) {} |
|
363 |
NodeIt(const Graph& _graph, const Node& node) |
|
364 |
: Node(node), graph(&_graph) {} |
|
366 | 365 |
|
367 | 366 |
NodeIt& operator++() { |
368 |
|
|
367 |
graph->next(*this); |
|
369 | 368 |
return *this; |
... | ... |
@@ -375,3 +374,3 @@ |
375 | 374 |
class ArcIt : public Arc { |
376 |
const |
|
375 |
const Graph* graph; |
|
377 | 376 |
public: |
... | ... |
@@ -382,3 +381,3 @@ |
382 | 381 |
|
383 |
explicit ArcIt(const |
|
382 |
explicit ArcIt(const Graph& _graph) : graph(&_graph) { |
|
384 | 383 |
_graph.first(static_cast<Arc&>(*this)); |
... | ... |
@@ -386,7 +385,7 @@ |
386 | 385 |
|
387 |
ArcIt(const Digraph& _graph, const Arc& e) : |
|
388 |
Arc(e), digraph(&_graph) { } |
|
386 |
ArcIt(const Graph& _graph, const Arc& e) : |
|
387 |
Arc(e), graph(&_graph) { } |
|
389 | 388 |
|
390 | 389 |
ArcIt& operator++() { |
391 |
|
|
390 |
graph->next(*this); |
|
392 | 391 |
return *this; |
... | ... |
@@ -398,3 +397,3 @@ |
398 | 397 |
class OutArcIt : public Arc { |
399 |
const |
|
398 |
const Graph* graph; |
|
400 | 399 |
public: |
... | ... |
@@ -405,4 +404,4 @@ |
405 | 404 |
|
406 |
OutArcIt(const Digraph& _graph, const Node& node) |
|
407 |
: digraph(&_graph) { |
|
405 |
OutArcIt(const Graph& _graph, const Node& node) |
|
406 |
: graph(&_graph) { |
|
408 | 407 |
_graph.firstOut(*this, node); |
... | ... |
@@ -410,7 +409,7 @@ |
410 | 409 |
|
411 |
OutArcIt(const Digraph& _graph, const Arc& arc) |
|
412 |
: Arc(arc), digraph(&_graph) {} |
|
410 |
OutArcIt(const Graph& _graph, const Arc& arc) |
|
411 |
: Arc(arc), graph(&_graph) {} |
|
413 | 412 |
|
414 | 413 |
OutArcIt& operator++() { |
415 |
|
|
414 |
graph->nextOut(*this); |
|
416 | 415 |
return *this; |
... | ... |
@@ -422,3 +421,3 @@ |
422 | 421 |
class InArcIt : public Arc { |
423 |
const |
|
422 |
const Graph* graph; |
|
424 | 423 |
public: |
... | ... |
@@ -429,4 +428,4 @@ |
429 | 428 |
|
430 |
InArcIt(const Digraph& _graph, const Node& node) |
|
431 |
: digraph(&_graph) { |
|
429 |
InArcIt(const Graph& _graph, const Node& node) |
|
430 |
: graph(&_graph) { |
|
432 | 431 |
_graph.firstIn(*this, node); |
... | ... |
@@ -434,7 +433,7 @@ |
434 | 433 |
|
435 |
InArcIt(const Digraph& _graph, const Arc& arc) : |
|
436 |
Arc(arc), digraph(&_graph) {} |
|
434 |
InArcIt(const Graph& _graph, const Arc& arc) : |
|
435 |
Arc(arc), graph(&_graph) {} |
|
437 | 436 |
|
438 | 437 |
InArcIt& operator++() { |
439 |
|
|
438 |
graph->nextIn(*this); |
|
440 | 439 |
return *this; |
... | ... |
@@ -446,3 +445,3 @@ |
446 | 445 |
class EdgeIt : public Parent::Edge { |
447 |
const |
|
446 |
const Graph* graph; |
|
448 | 447 |
public: |
... | ... |
@@ -453,3 +452,3 @@ |
453 | 452 |
|
454 |
explicit EdgeIt(const |
|
453 |
explicit EdgeIt(const Graph& _graph) : graph(&_graph) { |
|
455 | 454 |
_graph.first(static_cast<Edge&>(*this)); |
... | ... |
@@ -457,7 +456,7 @@ |
457 | 456 |
|
458 |
EdgeIt(const Digraph& _graph, const Edge& e) : |
|
459 |
Edge(e), digraph(&_graph) { } |
|
457 |
EdgeIt(const Graph& _graph, const Edge& e) : |
|
458 |
Edge(e), graph(&_graph) { } |
|
460 | 459 |
|
461 | 460 |
EdgeIt& operator++() { |
462 |
|
|
461 |
graph->next(*this); |
|
463 | 462 |
return *this; |
... | ... |
@@ -469,3 +468,3 @@ |
469 | 468 |
friend class EdgeSetExtender; |
470 |
const |
|
469 |
const Graph* graph; |
|
471 | 470 |
bool direction; |
... | ... |
@@ -477,3 +476,3 @@ |
477 | 476 |
|
478 |
IncEdgeIt(const |
|
477 |
IncEdgeIt(const Graph& _graph, const Node &n) : graph(&_graph) { |
|
479 | 478 |
_graph.firstInc(*this, direction, n); |
... | ... |
@@ -481,4 +480,4 @@ |
481 | 480 |
|
482 |
IncEdgeIt(const Digraph& _graph, const Edge &ue, const Node &n) |
|
483 |
: digraph(&_graph), Edge(ue) { |
|
481 |
IncEdgeIt(const Graph& _graph, const Edge &ue, const Node &n) |
|
482 |
: graph(&_graph), Edge(ue) { |
|
484 | 483 |
direction = (_graph.source(ue) == n); |
... | ... |
@@ -487,3 +486,3 @@ |
487 | 486 |
IncEdgeIt& operator++() { |
488 |
|
|
487 |
graph->nextInc(*this, direction); |
|
489 | 488 |
return *this; |
... | ... |
@@ -536,10 +535,9 @@ |
536 | 535 |
class ArcMap |
537 |
: public MapExtender<DefaultMap< |
|
536 |
: public MapExtender<DefaultMap<Graph, Arc, _Value> > { |
|
537 |
typedef MapExtender<DefaultMap<Graph, Arc, _Value> > Parent; |
|
538 |
|
|
538 | 539 |
public: |
539 |
typedef EdgeSetExtender Digraph; |
|
540 |
typedef MapExtender<DefaultMap<Digraph, Arc, _Value> > Parent; |
|
541 |
|
|
542 |
ArcMap(const Digraph& _g) |
|
540 |
ArcMap(const Graph& _g) |
|
543 | 541 |
: Parent(_g) {} |
544 |
ArcMap(const |
|
542 |
ArcMap(const Graph& _g, const _Value& _v) |
|
545 | 543 |
: Parent(_g, _v) {} |
... | ... |
@@ -561,11 +559,10 @@ |
561 | 559 |
class EdgeMap |
562 |
: public MapExtender<DefaultMap< |
|
560 |
: public MapExtender<DefaultMap<Graph, Edge, _Value> > { |
|
561 |
typedef MapExtender<DefaultMap<Graph, Edge, _Value> > Parent; |
|
562 |
|
|
563 | 563 |
public: |
564 |
typedef EdgeSetExtender Digraph; |
|
565 |
typedef MapExtender<DefaultMap<Digraph, Edge, _Value> > Parent; |
|
566 |
|
|
567 |
EdgeMap(const Digraph& _g) |
|
564 |
EdgeMap(const Graph& _g) |
|
568 | 565 |
: Parent(_g) {} |
569 | 566 |
|
570 |
EdgeMap(const |
|
567 |
EdgeMap(const Graph& _g, const _Value& _v) |
|
571 | 568 |
: Parent(_g, _v) {} |
... | ... |
@@ -28,5 +28,6 @@ |
28 | 28 |
class DigraphAdaptorExtender : public _Digraph { |
29 |
typedef _Digraph Parent; |
|
30 |
|
|
29 | 31 |
public: |
30 | 32 |
|
31 |
typedef _Digraph Parent; |
|
32 | 33 |
typedef _Digraph Digraph; |
... | ... |
@@ -175,5 +176,6 @@ |
175 | 176 |
class GraphAdaptorExtender : public _Graph { |
177 |
typedef _Graph Parent; |
|
178 |
|
|
176 | 179 |
public: |
177 | 180 |
|
178 |
typedef _Graph Parent; |
|
179 | 181 |
typedef _Graph Graph; |
... | ... |
@@ -39,5 +39,6 @@ |
39 | 39 |
class DigraphExtender : public Base { |
40 |
typedef Base Parent; |
|
41 |
|
|
40 | 42 |
public: |
41 | 43 |
|
42 |
typedef Base Parent; |
|
43 | 44 |
typedef DigraphExtender Digraph; |
... | ... |
@@ -220,6 +221,5 @@ |
220 | 221 |
: public MapExtender<DefaultMap<Digraph, Node, _Value> > { |
221 |
public: |
|
222 |
typedef DigraphExtender Digraph; |
|
223 | 222 |
typedef MapExtender<DefaultMap<Digraph, Node, _Value> > Parent; |
224 | 223 |
|
224 |
public: |
|
225 | 225 |
explicit NodeMap(const Digraph& digraph) |
... | ... |
@@ -245,6 +245,5 @@ |
245 | 245 |
: public MapExtender<DefaultMap<Digraph, Arc, _Value> > { |
246 |
public: |
|
247 |
typedef DigraphExtender Digraph; |
|
248 | 246 |
typedef MapExtender<DefaultMap<Digraph, Arc, _Value> > Parent; |
249 | 247 |
|
248 |
public: |
|
250 | 249 |
explicit ArcMap(const Digraph& digraph) |
... | ... |
@@ -332,5 +331,6 @@ |
332 | 331 |
class GraphExtender : public Base { |
332 |
typedef Base Parent; |
|
333 |
|
|
333 | 334 |
public: |
334 | 335 |
|
335 |
typedef Base Parent; |
|
336 | 336 |
typedef GraphExtender Graph; |
... | ... |
@@ -603,6 +603,5 @@ |
603 | 603 |
: public MapExtender<DefaultMap<Graph, Node, _Value> > { |
604 |
public: |
|
605 |
typedef GraphExtender Graph; |
|
606 | 604 |
typedef MapExtender<DefaultMap<Graph, Node, _Value> > Parent; |
607 | 605 |
|
606 |
public: |
|
608 | 607 |
NodeMap(const Graph& graph) |
... | ... |
@@ -628,6 +627,5 @@ |
628 | 627 |
: public MapExtender<DefaultMap<Graph, Arc, _Value> > { |
629 |
public: |
|
630 |
typedef GraphExtender Graph; |
|
631 | 628 |
typedef MapExtender<DefaultMap<Graph, Arc, _Value> > Parent; |
632 | 629 |
|
630 |
public: |
|
633 | 631 |
ArcMap(const Graph& graph) |
... | ... |
@@ -653,6 +651,5 @@ |
653 | 651 |
: public MapExtender<DefaultMap<Graph, Edge, _Value> > { |
654 |
public: |
|
655 |
typedef GraphExtender Graph; |
|
656 | 652 |
typedef MapExtender<DefaultMap<Graph, Edge, _Value> > Parent; |
657 | 653 |
|
654 |
public: |
|
658 | 655 |
EdgeMap(const Graph& graph) |
... | ... |
@@ -38,9 +38,8 @@ |
38 | 38 |
class MapExtender : public _Map { |
39 |
typedef _Map Parent; |
|
40 |
typedef typename Parent::GraphType GraphType; |
|
41 |
|
|
39 | 42 |
public: |
40 | 43 |
|
41 |
typedef _Map Parent; |
|
42 | 44 |
typedef MapExtender Map; |
43 |
|
|
44 |
|
|
45 |
typedef typename Parent::Graph Graph; |
|
46 | 45 |
typedef typename Parent::Key Item; |
... | ... |
@@ -60,6 +59,6 @@ |
60 | 59 |
|
61 |
MapExtender(const |
|
60 |
MapExtender(const GraphType& graph) |
|
62 | 61 |
: Parent(graph) {} |
63 | 62 |
|
64 |
MapExtender(const |
|
63 |
MapExtender(const GraphType& graph, const Value& value) |
|
65 | 64 |
: Parent(graph, value) {} |
... | ... |
@@ -79,5 +78,6 @@ |
79 | 78 |
class MapIt : public Item { |
79 |
typedef Item Parent; |
|
80 |
|
|
80 | 81 |
public: |
81 | 82 |
|
82 |
typedef Item Parent; |
|
83 | 83 |
typedef typename Map::Value Value; |
... | ... |
@@ -118,6 +118,6 @@ |
118 | 118 |
class ConstMapIt : public Item { |
119 |
typedef Item Parent; |
|
120 |
|
|
119 | 121 |
public: |
120 | 122 |
|
121 |
typedef Item Parent; |
|
122 |
|
|
123 | 123 |
typedef typename Map::Value Value; |
... | ... |
@@ -149,6 +149,6 @@ |
149 | 149 |
class ItemIt : public Item { |
150 |
typedef Item Parent; |
|
151 |
|
|
150 | 152 |
public: |
151 | 153 |
|
152 |
typedef Item Parent; |
|
153 |
|
|
154 | 154 |
ItemIt() {} |
... | ... |
@@ -180,9 +180,8 @@ |
180 | 180 |
class SubMapExtender : public _Map { |
181 |
typedef _Map Parent; |
|
182 |
typedef _Graph GraphType; |
|
183 |
|
|
181 | 184 |
public: |
182 | 185 |
|
183 |
typedef _Map Parent; |
|
184 | 186 |
typedef SubMapExtender Map; |
185 |
|
|
186 |
typedef _Graph Graph; |
|
187 |
|
|
188 | 187 |
typedef typename Parent::Key Item; |
... | ... |
@@ -202,6 +201,6 @@ |
202 | 201 |
|
203 |
SubMapExtender(const |
|
202 |
SubMapExtender(const GraphType& _graph) |
|
204 | 203 |
: Parent(_graph), graph(_graph) {} |
205 | 204 |
|
206 |
SubMapExtender(const |
|
205 |
SubMapExtender(const GraphType& _graph, const Value& _value) |
|
207 | 206 |
: Parent(_graph, _value), graph(_graph) {} |
... | ... |
@@ -225,5 +224,5 @@ |
225 | 224 |
class MapIt : public Item { |
225 |
typedef Item Parent; |
|
226 |
|
|
226 | 227 |
public: |
227 |
|
|
228 |
typedef Item Parent; |
|
229 | 228 |
typedef typename Map::Value Value; |
... | ... |
@@ -264,6 +263,6 @@ |
264 | 263 |
class ConstMapIt : public Item { |
264 |
typedef Item Parent; |
|
265 |
|
|
265 | 266 |
public: |
266 | 267 |
|
267 |
typedef Item Parent; |
|
268 |
|
|
269 | 268 |
typedef typename Map::Value Value; |
... | ... |
@@ -295,6 +294,6 @@ |
295 | 294 |
class ItemIt : public Item { |
295 |
typedef Item Parent; |
|
296 |
|
|
296 | 297 |
public: |
297 | 298 |
|
298 |
typedef Item Parent; |
|
299 |
|
|
300 | 299 |
ItemIt() {} |
... | ... |
@@ -322,3 +321,3 @@ |
322 | 321 |
|
323 |
const |
|
322 |
const GraphType& graph; |
|
324 | 323 |
... | ... |
@@ -58,3 +58,3 @@ |
58 | 58 |
// The graph type of the map. |
59 |
typedef _Graph |
|
59 |
typedef _Graph GraphType; |
|
60 | 60 |
// The item type of the map. |
... | ... |
@@ -74,4 +74,2 @@ |
74 | 74 |
typedef VectorMap Map; |
75 |
// The base class of the map. |
|
76 |
typedef typename Notifier::ObserverBase Parent; |
|
77 | 75 |
|
... | ... |
@@ -82,2 +80,8 @@ |
82 | 80 |
|
81 |
private: |
|
82 |
|
|
83 |
// The base class of the map. |
|
84 |
typedef typename Notifier::ObserverBase Parent; |
|
85 |
|
|
86 |
public: |
|
83 | 87 |
|
... | ... |
@@ -87,3 +91,3 @@ |
87 | 91 |
// It adds all the items of the graph to the map. |
88 |
VectorMap(const |
|
92 |
VectorMap(const GraphType& graph) { |
|
89 | 93 |
Parent::attach(graph.notifier(Item())); |
... | ... |
@@ -96,3 +100,3 @@ |
96 | 100 |
// It adds all the items of the graph to the map. |
97 |
VectorMap(const |
|
101 |
VectorMap(const GraphType& graph, const Value& value) { |
|
98 | 102 |
Parent::attach(graph.notifier(Item())); |
... | ... |
@@ -182,2 +182,5 @@ |
182 | 182 |
public: |
183 |
|
|
184 |
typedef BaseGraphComponent Graph; |
|
185 |
|
|
183 | 186 |
typedef BaseDigraphComponent::Node Node; |
... | ... |
@@ -191,5 +194,5 @@ |
191 | 194 |
class Edge : public GraphItem<'e'> { |
192 |
public: |
|
193 | 195 |
typedef GraphItem<'e'> Parent; |
194 | 196 |
|
197 |
public: |
|
195 | 198 |
/// \brief Default constructor. |
... | ... |
@@ -993,8 +996,6 @@ |
993 | 996 |
class GraphMap : public ReferenceMap<K, V, V&, const V&> { |
997 |
typedef ReferenceMap<K, V, V&, const V&> Parent; |
|
998 |
|
|
994 | 999 |
public: |
995 | 1000 |
|
996 |
typedef ReadWriteMap<K, V> Parent; |
|
997 |
|
|
998 |
/// The graph type of the map. |
|
999 |
typedef GR Graph; |
|
1000 | 1001 |
/// The key type of the map. |
... | ... |
@@ -1014,3 +1015,3 @@ |
1014 | 1015 |
/// Construct a new map for the graph. |
1015 |
explicit GraphMap(const |
|
1016 |
explicit GraphMap(const GR&) {} |
|
1016 | 1017 |
/// \brief Construct a new map with default value. |
... | ... |
@@ -1018,3 +1019,3 @@ |
1018 | 1019 |
/// Construct a new map for the graph and initalize the values. |
1019 |
GraphMap(const |
|
1020 |
GraphMap(const GR&, const Value&) {} |
|
1020 | 1021 |
|
... | ... |
@@ -1059,3 +1060,3 @@ |
1059 | 1060 |
const _Map &m; |
1060 |
const |
|
1061 |
const GR &g; |
|
1061 | 1062 |
const typename GraphMap::Value &t; |
... | ... |
@@ -1087,5 +1088,5 @@ |
1087 | 1088 |
class NodeMap : public GraphMap<MappableDigraphComponent, Node, V> { |
1088 |
public: |
|
1089 | 1089 |
typedef GraphMap<MappableDigraphComponent, Node, V> Parent; |
1090 | 1090 |
|
1091 |
public: |
|
1091 | 1092 |
/// \brief Construct a new map. |
... | ... |
@@ -1125,5 +1126,5 @@ |
1125 | 1126 |
class ArcMap : public GraphMap<MappableDigraphComponent, Arc, V> { |
1126 |
public: |
|
1127 | 1127 |
typedef GraphMap<MappableDigraphComponent, Arc, V> Parent; |
1128 | 1128 |
|
1129 |
public: |
|
1129 | 1130 |
/// \brief Construct a new map. |
... | ... |
@@ -1223,5 +1224,5 @@ |
1223 | 1224 |
class EdgeMap : public GraphMap<MappableGraphComponent, Edge, V> { |
1224 |
public: |
|
1225 | 1225 |
typedef GraphMap<MappableGraphComponent, Edge, V> Parent; |
1226 | 1226 |
|
1227 |
public: |
|
1227 | 1228 |
/// \brief Construct a new map. |
... | ... |
@@ -1038,9 +1038,8 @@ |
1038 | 1038 |
class ConArcIt : public GR::Arc { |
1039 |
typedef typename GR::Arc Parent; |
|
1040 |
|
|
1039 | 1041 |
public: |
1040 | 1042 |
|
1041 |
typedef GR Graph; |
|
1042 |
typedef typename Graph::Arc Parent; |
|
1043 |
|
|
1044 |
typedef typename Graph::Arc Arc; |
|
1045 |
typedef typename |
|
1043 |
typedef typename GR::Arc Arc; |
|
1044 |
typedef typename GR::Node Node; |
|
1046 | 1045 |
|
... | ... |
@@ -1050,3 +1049,3 @@ |
1050 | 1049 |
/// connects nodes \c u and \c v. |
1051 |
ConArcIt(const |
|
1050 |
ConArcIt(const GR& g, Node u, Node v) : _graph(g) { |
|
1052 | 1051 |
Parent::operator=(findArc(_graph, u, v)); |
... | ... |
@@ -1057,3 +1056,3 @@ |
1057 | 1056 |
/// Construct a new ConArcIt that continues the iterating from arc \c a. |
1058 |
ConArcIt(const |
|
1057 |
ConArcIt(const GR& g, Arc a) : Parent(a), _graph(g) {} |
|
1059 | 1058 |
|
... | ... |
@@ -1068,3 +1067,3 @@ |
1068 | 1067 |
private: |
1069 |
const |
|
1068 |
const GR& _graph; |
|
1070 | 1069 |
}; |
... | ... |
@@ -1161,9 +1160,8 @@ |
1161 | 1160 |
class ConEdgeIt : public GR::Edge { |
1161 |
typedef typename GR::Edge Parent; |
|
1162 |
|
|
1162 | 1163 |
public: |
1163 | 1164 |
|
1164 |
typedef GR Graph; |
|
1165 |
typedef typename Graph::Edge Parent; |
|
1166 |
|
|
1167 |
typedef typename Graph::Edge Edge; |
|
1168 |
typedef typename |
|
1165 |
typedef typename GR::Edge Edge; |
|
1166 |
typedef typename GR::Node Node; |
|
1169 | 1167 |
|
... | ... |
@@ -1173,3 +1171,3 @@ |
1173 | 1171 |
/// connects nodes \c u and \c v. |
1174 |
ConEdgeIt(const |
|
1172 |
ConEdgeIt(const GR& g, Node u, Node v) : _graph(g), _u(u), _v(v) { |
|
1175 | 1173 |
Parent::operator=(findEdge(_graph, _u, _v)); |
... | ... |
@@ -1180,3 +1178,3 @@ |
1180 | 1178 |
/// Construct a new ConEdgeIt that continues iterating from edge \c e. |
1181 |
ConEdgeIt(const |
|
1179 |
ConEdgeIt(const GR& g, Edge e) : Parent(e), _graph(g) {} |
|
1182 | 1180 |
|
... | ... |
@@ -1190,3 +1188,3 @@ |
1190 | 1188 |
private: |
1191 |
const |
|
1189 |
const GR& _graph; |
|
1192 | 1190 |
Node _u, _v; |
... | ... |
@@ -1221,3 +1219,2 @@ |
1221 | 1219 |
{ |
1222 |
public: |
|
1223 | 1220 |
typedef typename ItemSetTraits<GR, typename GR::Arc> |
... | ... |
@@ -1226,2 +1223,6 @@ |
1226 | 1223 |
TEMPLATE_DIGRAPH_TYPEDEFS(GR); |
1224 |
|
|
1225 |
public: |
|
1226 |
|
|
1227 |
/// The Digraph type |
|
1227 | 1228 |
typedef GR Digraph; |
... | ... |
@@ -1231,6 +1232,6 @@ |
1231 | 1232 |
class AutoNodeMap : public ItemSetTraits<GR, Node>::template Map<Arc>::Type { |
1233 |
typedef typename ItemSetTraits<GR, Node>::template Map<Arc>::Type Parent; |
|
1234 |
|
|
1232 | 1235 |
public: |
1233 | 1236 |
|
1234 |
typedef typename ItemSetTraits<GR, Node>::template Map<Arc>::Type Parent; |
|
1235 |
|
|
1236 | 1237 |
AutoNodeMap(const GR& digraph) : Parent(digraph, INVALID) {} |
... | ... |
@@ -1259,8 +1260,2 @@ |
1259 | 1260 |
|
1260 |
const Digraph &_g; |
|
1261 |
AutoNodeMap _head; |
|
1262 |
typename Digraph::template ArcMap<Arc> _parent; |
|
1263 |
typename Digraph::template ArcMap<Arc> _left; |
|
1264 |
typename Digraph::template ArcMap<Arc> _right; |
|
1265 |
|
|
1266 | 1261 |
class ArcLess { |
... | ... |
@@ -1275,2 +1270,10 @@ |
1275 | 1270 |
|
1271 |
protected: |
|
1272 |
|
|
1273 |
const Digraph &_g; |
|
1274 |
AutoNodeMap _head; |
|
1275 |
typename Digraph::template ArcMap<Arc> _parent; |
|
1276 |
typename Digraph::template ArcMap<Arc> _left; |
|
1277 |
typename Digraph::template ArcMap<Arc> _right; |
|
1278 |
|
|
1276 | 1279 |
public: |
... | ... |
@@ -1632,4 +1635,7 @@ |
1632 | 1635 |
{ |
1636 |
TEMPLATE_DIGRAPH_TYPEDEFS(GR); |
|
1637 |
|
|
1633 | 1638 |
public: |
1634 |
|
|
1639 |
|
|
1640 |
/// The Digraph type |
|
1635 | 1641 |
typedef GR Digraph; |
... | ... |
@@ -1748,5 +1754,4 @@ |
1748 | 1754 |
TEMPLATE_DIGRAPH_TYPEDEFS(GR); |
1749 |
typedef GR Digraph; |
|
1750 | 1755 |
|
1751 |
typename |
|
1756 |
typename GR::template ArcMap<Arc> _next; |
|
1752 | 1757 |
|
... | ... |
@@ -1769,2 +1774,6 @@ |
1769 | 1774 |
public: |
1775 |
|
|
1776 |
/// The Digraph type |
|
1777 |
typedef GR Digraph; |
|
1778 |
|
|
1770 | 1779 |
///Constructor |
... | ... |
@@ -35,3 +35,2 @@ |
35 | 35 |
|
36 |
typedef GR Graph; |
|
37 | 36 |
typedef typename GR::Node Node; |
... | ... |
@@ -210,6 +209,6 @@ |
210 | 209 |
class NodeMap : public GR::template NodeMap<V> { |
210 |
typedef typename GR::template NodeMap<V> Parent; |
|
211 |
|
|
211 | 212 |
public: |
212 | 213 |
|
213 |
typedef typename GR::template NodeMap<V> Parent; |
|
214 |
|
|
215 | 214 |
explicit NodeMap(const ListArcSetBase<GR>& arcset) |
... | ... |
@@ -261,2 +260,3 @@ |
261 | 260 |
class ListArcSet : public ArcSetExtender<ListArcSetBase<GR> > { |
261 |
typedef ArcSetExtender<ListArcSetBase<GR> > Parent; |
|
262 | 262 |
|
... | ... |
@@ -264,4 +264,2 @@ |
264 | 264 |
|
265 |
typedef ArcSetExtender<ListArcSetBase<GR> > Parent; |
|
266 |
|
|
267 | 265 |
typedef typename Parent::Node Node; |
... | ... |
@@ -269,5 +267,2 @@ |
269 | 267 |
|
270 |
typedef GR Graph; |
|
271 |
|
|
272 |
|
|
273 | 268 |
typedef typename Parent::NodesImplBase NodesImplBase; |
... | ... |
@@ -294,5 +289,5 @@ |
294 | 289 |
class NodesImpl : public NodesImplBase { |
295 |
public: |
|
296 | 290 |
typedef NodesImplBase Parent; |
297 | 291 |
|
292 |
public: |
|
298 | 293 |
NodesImpl(const GR& graph, ListArcSet& arcset) |
... | ... |
@@ -356,3 +351,2 @@ |
356 | 351 |
|
357 |
typedef GR Graph; |
|
358 | 352 |
typedef typename GR::Node Node; |
... | ... |
@@ -639,6 +633,6 @@ |
639 | 633 |
class NodeMap : public GR::template NodeMap<V> { |
634 |
typedef typename GR::template NodeMap<V> Parent; |
|
635 |
|
|
640 | 636 |
public: |
641 | 637 |
|
642 |
typedef typename GR::template NodeMap<V> Parent; |
|
643 |
|
|
644 | 638 |
explicit NodeMap(const ListEdgeSetBase<GR>& arcset) |
... | ... |
@@ -690,2 +684,3 @@ |
690 | 684 |
class ListEdgeSet : public EdgeSetExtender<ListEdgeSetBase<GR> > { |
685 |
typedef EdgeSetExtender<ListEdgeSetBase<GR> > Parent; |
|
691 | 686 |
|
... | ... |
@@ -693,4 +688,2 @@ |
693 | 688 |
|
694 |
typedef EdgeSetExtender<ListEdgeSetBase<GR> > Parent; |
|
695 |
|
|
696 | 689 |
typedef typename Parent::Node Node; |
... | ... |
@@ -699,5 +692,2 @@ |
699 | 692 |
|
700 |
typedef GR Graph; |
|
701 |
|
|
702 |
|
|
703 | 693 |
typedef typename Parent::NodesImplBase NodesImplBase; |
... | ... |
@@ -719,5 +709,5 @@ |
719 | 709 |
class NodesImpl : public NodesImplBase { |
720 |
public: |
|
721 | 710 |
typedef NodesImplBase Parent; |
722 | 711 |
|
712 |
public: |
|
723 | 713 |
NodesImpl(const GR& graph, ListEdgeSet& arcset) |
... | ... |
@@ -781,5 +771,4 @@ |
781 | 771 |
|
782 |
typedef GR Graph; |
|
783 |
typedef typename Graph::Node Node; |
|
784 |
typedef typename |
|
772 |
typedef typename GR::Node Node; |
|
773 |
typedef typename GR::NodeIt NodeIt; |
|
785 | 774 |
|
... | ... |
@@ -902,6 +891,6 @@ |
902 | 891 |
class NodeMap : public GR::template NodeMap<V> { |
892 |
typedef typename GR::template NodeMap<V> Parent; |
|
893 |
|
|
903 | 894 |
public: |
904 | 895 |
|
905 |
typedef typename GR::template NodeMap<V> Parent; |
|
906 |
|
|
907 | 896 |
explicit NodeMap(const SmartArcSetBase<GR>& arcset) |
... | ... |
@@ -958,2 +947,3 @@ |
958 | 947 |
class SmartArcSet : public ArcSetExtender<SmartArcSetBase<GR> > { |
948 |
typedef ArcSetExtender<SmartArcSetBase<GR> > Parent; |
|
959 | 949 |
|
... | ... |
@@ -961,4 +951,2 @@ |
961 | 951 |
|
962 |
typedef ArcSetExtender<SmartArcSetBase<GR> > Parent; |
|
963 |
|
|
964 | 952 |
typedef typename Parent::Node Node; |
... | ... |
@@ -966,4 +954,2 @@ |
966 | 954 |
|
967 |
typedef GR Graph; |
|
968 |
|
|
969 | 955 |
protected: |
... | ... |
@@ -985,5 +971,5 @@ |
985 | 971 |
class NodesImpl : public NodesImplBase { |
986 |
public: |
|
987 | 972 |
typedef NodesImplBase Parent; |
988 | 973 |
|
974 |
public: |
|
989 | 975 |
NodesImpl(const GR& graph, SmartArcSet& arcset) |
... | ... |
@@ -1064,3 +1050,2 @@ |
1064 | 1050 |
|
1065 |
typedef GR Graph; |
|
1066 | 1051 |
typedef typename GR::Node Node; |
... | ... |
@@ -1251,6 +1236,6 @@ |
1251 | 1236 |
class NodeMap : public GR::template NodeMap<V> { |
1237 |
typedef typename GR::template NodeMap<V> Parent; |
|
1238 |
|
|
1252 | 1239 |
public: |
1253 | 1240 |
|
1254 |
typedef typename GR::template NodeMap<V> Parent; |
|
1255 |
|
|
1256 | 1241 |
explicit NodeMap(const SmartEdgeSetBase<GR>& arcset) |
... | ... |
@@ -1306,2 +1291,3 @@ |
1306 | 1291 |
class SmartEdgeSet : public EdgeSetExtender<SmartEdgeSetBase<GR> > { |
1292 |
typedef EdgeSetExtender<SmartEdgeSetBase<GR> > Parent; |
|
1307 | 1293 |
|
... | ... |
@@ -1309,4 +1295,2 @@ |
1309 | 1295 |
|
1310 |
typedef EdgeSetExtender<SmartEdgeSetBase<GR> > Parent; |
|
1311 |
|
|
1312 | 1296 |
typedef typename Parent::Node Node; |
... | ... |
@@ -1315,4 +1299,2 @@ |
1315 | 1299 |
|
1316 |
typedef GR Graph; |
|
1317 |
|
|
1318 | 1300 |
protected: |
... | ... |
@@ -1333,5 +1315,5 @@ |
1333 | 1315 |
class NodesImpl : public NodesImplBase { |
1334 |
public: |
|
1335 | 1316 |
typedef NodesImplBase Parent; |
1336 | 1317 |
|
1318 |
public: |
|
1337 | 1319 |
NodesImpl(const GR& graph, SmartEdgeSet& arcset) |
... | ... |
@@ -33,3 +33,3 @@ |
33 | 33 |
|
34 |
typedef FullDigraphBase |
|
34 |
typedef FullDigraphBase Digraph; |
|
35 | 35 |
|
... | ... |
@@ -171,6 +171,6 @@ |
171 | 171 |
class FullDigraph : public ExtendedFullDigraphBase { |
172 |
typedef ExtendedFullDigraphBase Parent; |
|
173 |
|
|
172 | 174 |
public: |
173 | 175 |
|
174 |
typedef ExtendedFullDigraphBase Parent; |
|
175 |
|
|
176 | 176 |
/// \brief Constructor |
... | ... |
@@ -228,4 +228,2 @@ |
228 | 228 |
class FullGraphBase { |
229 |
int _node_num; |
|
230 |
int _edge_num; |
|
231 | 229 |
public: |
... | ... |
@@ -240,2 +238,5 @@ |
240 | 238 |
|
239 |
int _node_num; |
|
240 |
int _edge_num; |
|
241 |
|
|
241 | 242 |
FullGraphBase() {} |
... | ... |
@@ -539,6 +540,6 @@ |
539 | 540 |
class FullGraph : public ExtendedFullGraphBase { |
541 |
typedef ExtendedFullGraphBase Parent; |
|
542 |
|
|
540 | 543 |
public: |
541 | 544 |
|
542 |
typedef ExtendedFullGraphBase Parent; |
|
543 |
|
|
544 | 545 |
/// \brief Constructor |
... | ... |
@@ -325,2 +325,4 @@ |
325 | 325 |
class ListDigraph : public ExtendedListDigraphBase { |
326 |
typedef ExtendedListDigraphBase Parent; |
|
327 |
|
|
326 | 328 |
private: |
... | ... |
@@ -339,4 +341,2 @@ |
339 | 341 |
|
340 |
typedef ExtendedListDigraphBase Parent; |
|
341 |
|
|
342 | 342 |
/// Constructor |
... | ... |
@@ -795,3 +795,3 @@ |
795 | 795 |
|
796 |
typedef ListGraphBase |
|
796 |
typedef ListGraphBase Graph; |
|
797 | 797 |
|
... | ... |
@@ -1178,2 +1178,4 @@ |
1178 | 1178 |
class ListGraph : public ExtendedListGraphBase { |
1179 |
typedef ExtendedListGraphBase Parent; |
|
1180 |
|
|
1179 | 1181 |
private: |
... | ... |
@@ -1197,4 +1199,2 @@ |
1197 | 1199 |
|
1198 |
typedef ExtendedListGraphBase Parent; |
|
1199 |
|
|
1200 | 1200 |
typedef Parent::OutArcIt IncEdgeIt; |
... | ... |
@@ -1840,2 +1840,3 @@ |
1840 | 1840 |
typedef GR Graph; |
1841 |
typedef GR Digraph; |
|
1841 | 1842 |
/// The key type of IdMap (\c Node, \c Arc or \c Edge). |
... | ... |
@@ -1931,2 +1932,3 @@ |
1931 | 1932 |
typedef GR Graph; |
1933 |
typedef GR Digraph; |
|
1932 | 1934 |
/// The key type of CrossRefMap (\c Node, \c Arc or \c Edge). |
... | ... |
@@ -2134,2 +2136,3 @@ |
2134 | 2136 |
typedef GR Graph; |
2137 |
typedef GR Digraph; |
|
2135 | 2138 |
/// The key type of RangeIdMap (\c Node, \c Arc or \c Edge). |
... | ... |
@@ -2496,3 +2499,4 @@ |
2496 | 2499 |
|
2497 |
/// The |
|
2500 |
/// The graph type of InDegMap |
|
2501 |
typedef GR Graph; |
|
2498 | 2502 |
typedef GR Digraph; |
... | ... |
@@ -2625,3 +2629,4 @@ |
2625 | 2629 |
|
2626 |
/// The |
|
2630 |
/// The graph type of OutDegMap |
|
2631 |
typedef GR Graph; |
|
2627 | 2632 |
typedef GR Digraph; |
... | ... |
@@ -57,3 +57,3 @@ |
57 | 57 |
|
58 |
typedef SmartDigraphBase |
|
58 |
typedef SmartDigraphBase Digraph; |
|
59 | 59 |
|
... | ... |
@@ -197,4 +197,2 @@ |
197 | 197 |
class SmartDigraph : public ExtendedSmartDigraphBase { |
198 |
public: |
|
199 |
|
|
200 | 198 |
typedef ExtendedSmartDigraphBase Parent; |
... | ... |
@@ -422,3 +420,3 @@ |
422 | 420 |
|
423 |
typedef SmartGraphBase |
|
421 |
typedef SmartGraphBase Graph; |
|
424 | 422 |
|
... | ... |
@@ -633,2 +631,4 @@ |
633 | 631 |
class SmartGraph : public ExtendedSmartGraphBase { |
632 |
typedef ExtendedSmartGraphBase Parent; |
|
633 |
|
|
634 | 634 |
private: |
... | ... |
@@ -650,4 +650,2 @@ |
650 | 650 |
|
651 |
typedef ExtendedSmartGraphBase Parent; |
|
652 |
|
|
653 | 651 |
/// Constructor |
0 comments (0 inline)