equal
deleted
inserted
replaced
1268 } |
1268 } |
1269 |
1269 |
1270 static int aNodeId(const Node& node) { |
1270 static int aNodeId(const Node& node) { |
1271 return node.id >> 1; |
1271 return node.id >> 1; |
1272 } |
1272 } |
1273 static Node fromANodeId(int id) { |
1273 static Node nodeFromANodeId(int id) { |
1274 return Node(id << 1); |
1274 return Node(id << 1); |
1275 } |
1275 } |
1276 int maxANodeId() const { |
1276 int maxANodeId() const { |
1277 return aNodes.size(); |
1277 return aNodes.size(); |
1278 } |
1278 } |
1279 |
1279 |
1280 static int bNodeId(const Node& node) { |
1280 static int bNodeId(const Node& node) { |
1281 return node.id >> 1; |
1281 return node.id >> 1; |
1282 } |
1282 } |
1283 static Node fromBNodeId(int id) { |
1283 static Node nodeFromBNodeId(int id) { |
1284 return Node((id << 1) + 1); |
1284 return Node((id << 1) + 1); |
1285 } |
1285 } |
1286 int maxBNodeId() const { |
1286 int maxBNodeId() const { |
1287 return bNodes.size(); |
1287 return bNodes.size(); |
1288 } |
1288 } |
1480 } |
1480 } |
1481 |
1481 |
1482 }; |
1482 }; |
1483 |
1483 |
1484 |
1484 |
1485 typedef BpUGraphExtender< ListBpUGraphBase > ExtendedListBpUGraphBase; |
1485 typedef BpUGraphExtender<BidirBpUGraphExtender<ListBpUGraphBase> > |
|
1486 ExtendedListBpUGraphBase; |
1486 |
1487 |
1487 /// \ingroup graphs |
1488 /// \ingroup graphs |
1488 /// |
1489 /// |
1489 /// \brief A smart bipartite undirected graph class. |
1490 /// \brief A smart bipartite undirected graph class. |
1490 /// |
1491 /// |