Changeset 1270:dceba191c00d in lemon for lemon/concepts
- Timestamp:
- 08/09/13 11:28:17 (11 years ago)
- Branch:
- default
- Children:
- 1271:fb1c7da561ce, 1381:e0ccc1f0268f
- Phase:
- public
- Location:
- lemon/concepts
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concepts/bpgraph.h
r1262 r1270 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). … … 805 805 806 806 /// \brief Gives back the red end node of the edge. 807 /// 807 /// 808 808 /// Gives back the red end node of the edge. 809 809 RedNode redNode(const Edge&) const { return RedNode(); } 810 810 811 811 /// \brief Gives back the blue end node of the edge. 812 /// 812 /// 813 813 /// Gives back the blue end node of the edge. 814 814 BlueNode blueNode(const Edge&) const { return BlueNode(); } -
lemon/concepts/digraph.h
r1261 r1270 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). -
lemon/concepts/graph.h
r1261 r1270 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). -
lemon/concepts/graph_components.h
r1262 r1270 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). … … 392 392 393 393 /// \brief Gives back the red end node of the edge. 394 /// 394 /// 395 395 /// Gives back the red end node of the edge. 396 396 RedNode redNode(const Edge&) const { return RedNode(); } 397 397 398 398 /// \brief Gives back the blue end node of the edge. 399 /// 399 /// 400 400 /// Gives back the blue end node of the edge. 401 401 BlueNode blueNode(const Edge&) const { return BlueNode(); } … … 1151 1151 typedef typename Base::Arc Arc; 1152 1152 typedef typename Base::Edge Edge; 1153 1153 1154 1154 typedef IterableBpGraphComponent BpGraph; 1155 1155 … … 1211 1211 typename _BpGraph::RedNode rn(INVALID); 1212 1212 bpgraph.first(rn); 1213 bpgraph.next(rn); 1213 bpgraph.next(rn); 1214 1214 typename _BpGraph::BlueNode bn(INVALID); 1215 1215 bpgraph.first(bn); -
lemon/concepts/heap.h
r1259 r1270 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). -
lemon/concepts/maps.h
r1257 r1270 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-20 095 * Copyright (C) 2003-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). -
lemon/concepts/path.h
r1259 r1270 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-20 095 * Copyright (C) 2003-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
Note: See TracChangeset
for help on using the changeset viewer.