Changeset 1092:dceba191c00d in lemon-main for lemon/core.h
- Timestamp:
- 08/09/13 11:28:17 (11 years ago)
- Branch:
- default
- Children:
- 1093:fb1c7da561ce, 1165:e0ccc1f0268f
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/core.h
r1086 r1092 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-201 05 * Copyright (C) 2003-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 255 255 256 256 namespace _graph_utils_bits { 257 257 258 258 template <typename Graph, typename Enable = void> 259 259 struct CountRedNodesSelector { … … 265 265 template <typename Graph> 266 266 struct CountRedNodesSelector< 267 Graph, typename 268 enable_if<typename Graph::NodeNumTag, void>::type> 267 Graph, typename 268 enable_if<typename Graph::NodeNumTag, void>::type> 269 269 { 270 270 static int count(const Graph &g) { 271 271 return g.redNum(); 272 272 } 273 }; 273 }; 274 274 } 275 275 … … 280 280 /// graph structures it is specialized to run in O(1). 281 281 /// 282 /// If the graph contains a \e redNum() member function and a 282 /// If the graph contains a \e redNum() member function and a 283 283 /// \e NodeNumTag tag then this function calls directly the member 284 284 /// function to query the cardinality of the node set. … … 289 289 290 290 namespace _graph_utils_bits { 291 291 292 292 template <typename Graph, typename Enable = void> 293 293 struct CountBlueNodesSelector { … … 299 299 template <typename Graph> 300 300 struct CountBlueNodesSelector< 301 Graph, typename 302 enable_if<typename Graph::NodeNumTag, void>::type> 301 Graph, typename 302 enable_if<typename Graph::NodeNumTag, void>::type> 303 303 { 304 304 static int count(const Graph &g) { 305 305 return g.blueNum(); 306 306 } 307 }; 307 }; 308 308 } 309 309 … … 314 314 /// graph structures it is specialized to run in O(1). 315 315 /// 316 /// If the graph contains a \e blueNum() member function and a 316 /// If the graph contains a \e blueNum() member function and a 317 317 /// \e NodeNumTag tag then this function calls directly the member 318 318 /// function to query the cardinality of the node set. … … 1866 1866 /// The Digraph type 1867 1867 typedef GR Digraph; 1868 1868 1869 1869 protected: 1870 1870
Note: See TracChangeset
for help on using the changeset viewer.