equal
deleted
inserted
replaced
607 } |
607 } |
608 |
608 |
609 static int aNodeId(const Node& node) { |
609 static int aNodeId(const Node& node) { |
610 return node.id >> 1; |
610 return node.id >> 1; |
611 } |
611 } |
612 static Node fromANodeId(int id) { |
612 static Node nodeFromANodeId(int id) { |
613 return Node(id << 1); |
613 return Node(id << 1); |
614 } |
614 } |
615 int maxANodeId() const { |
615 int maxANodeId() const { |
616 return _aNodeNum; |
616 return _aNodeNum; |
617 } |
617 } |
618 |
618 |
619 static int bNodeId(const Node& node) { |
619 static int bNodeId(const Node& node) { |
620 return node.id >> 1; |
620 return node.id >> 1; |
621 } |
621 } |
622 static Node fromBNodeId(int id) { |
622 static Node nodeFromBNodeId(int id) { |
623 return Node((id << 1) + 1); |
623 return Node((id << 1) + 1); |
624 } |
624 } |
625 int maxBNodeId() const { |
625 int maxBNodeId() const { |
626 return _bNodeNum; |
626 return _bNodeNum; |
627 } |
627 } |
663 } |
663 } |
664 |
664 |
665 }; |
665 }; |
666 |
666 |
667 |
667 |
668 typedef BpUGraphExtender<FullBpUGraphBase> ExtendedFullBpUGraphBase; |
668 typedef BpUGraphExtender<BidirBpUGraphExtender<FullBpUGraphBase> > |
|
669 ExtendedFullBpUGraphBase; |
669 |
670 |
670 |
671 |
671 /// \ingroup graphs |
672 /// \ingroup graphs |
672 /// |
673 /// |
673 /// \brief An undirected full bipartite graph class. |
674 /// \brief An undirected full bipartite graph class. |