- b -

• back() : Path< _Graph > , SimplePath< _Graph > , StaticPath< _Graph > , ListPath< _Graph >
• BackInserterBoolMap() : BackInserterBoolMap< Container, Functor >
• backtrack() : DfsVisitor< _Graph >
• backward() : ResGraphAdaptor< Graph, Number, CapacityMap, FlowMap, Tol >
• backwardMap() : BackwardMap< Graph >
• BackwardMap() : BackwardMap< Graph >
• barrier() : Circulation< _Graph, _LCapMap, _UCapMap, _DeltaMap, _Traits > , MaxMatching< Graph >
• barrierMap() : Circulation< _Graph, _LCapMap, _UCapMap, _DeltaMap, _Traits >
• baseNode() : EdgeSetExtender< Base > , UGraphExtender< Base > , BpUGraphExtender< Base > , UEdgeSetExtender< Base > , BpUGraphExtender< Base > , UEdgeSetExtender< Base > , BpUGraph , UEdgeSetExtender< Base > , BpUGraph , Graph , GraphAdaptorExtender< _Graph > , Graph , IterableGraphComponent< _Base > , GraphAdaptorExtender< _Graph > , IterableGraphComponent< _Base > , IterableUGraphComponent< _Base > , UGraphAdaptorExtender< _UGraph > , UGraph , UGraphAdaptorExtender< _UGraph > , UGraph , UGraphAdaptorExtender< _UGraph > , BpUGraphAdaptorExtender< Base > , GraphExtender< Base > , EdgeSetExtender< Base > , UGraphExtender< Base >
• bBarrier() : MaxBipartiteMatching< BpUGraph > , PrBipartiteMatching< Graph >
• begin() : StoreBoolMap< _Iterator, _Functor >
• beginValue() : InvertableMap< _Graph, _Item, _Value > , IterableValueMap< _Graph, _Item, _Value >
• BellmanFord() : BellmanFord< _Graph, _LengthMap, _Traits >
• BellmanFordWizard() : BellmanFordWizard< _Traits >
• BellmanFordWizardBase() : BellmanFordWizardBase< _Graph, _LengthMap >
• best() : TabuSearch< GRAPH, VALUE, POLICY, TRAITS >
• BestEligiblePivotRule() : BestEligiblePivotRule
• Bfs() : Bfs< GR, TR >
• BfsVisit() : BfsVisit< _Graph, _Visitor, _Traits >
• BfsWizard() : BfsWizard< TR >
• BfsWizardBase() : BfsWizardBase< GR >
• bidir() : GraphToEps< T >
• bindEdge() : SplitGraphAdaptorBase< _Graph >
• BinHeap() : BinHeap< _Prio, _ItemIntMap, _Compare >
• BiVariant() : BiVariant< _First, _Second >
• BlockSearchPivotRule() : BlockSearchPivotRule
• BlossomIt() : BlossomIt
• blossomNum() : MaxWeightedMatching< _UGraph, _WeightMap > , MaxWeightedPerfectMatching< _UGraph, _WeightMap >
• blossomSize() : MaxWeightedMatching< _UGraph, _WeightMap > , MaxWeightedPerfectMatching< _UGraph, _WeightMap >
• blossomValue() : MaxWeightedMatching< _UGraph, _WeightMap > , MaxWeightedPerfectMatching< _UGraph, _WeightMap >
• blue() : Color
• bMatching() : PrBipartiteMatching< Graph > , MaxBipartiteMatching< BpUGraph > , MaxWeightedBipartiteMatching< _BpUGraph, _WeightMap, _Traits > , MinCostMaxBipartiteMatching< _BpUGraph, _CostMap, _Traits >
• bNode() : BaseBpUGraphComponent , FullBpUGraph , BpUGraph , BaseBpUGraphComponent
• BNode() : BNode
• bNodeCrossRef() : BpUGraphCopy< To, From >
• bNodeId() : IDableBpUGraphComponent< _Base >
• bNodeIndex() : FullBpUGraph
• BNodeIt() : BNodeIt
• BNodeMap() : BNodeMap< T >
• bNodeMap() : BpUGraphCopy< To, From >
• BNodeMap() : BNodeMap< T > , BNodeMap< _Value >
• bNodeNum() : FullBpUGraph
• bNodeRef() : BpUGraphCopy< To, From >
• boolean() : Random
• boolOption() : ArgParser
• border() : GraphToEps< T >
• borrow() : RefPtr< T >
• bottom() : BoundingBox< T >
• bottomLeft() : BoundingBox< T >
• bottomRight() : BoundingBox< T >
• BoundingBox() : BoundingBox< T >
• BpNodeSetReader() : BpNodeSetReader< _Graph, _Traits >
• BpNodeSetWriter() : BpNodeSetWriter< _Graph, _Traits >
• BpUGraphCopy() : BpUGraphCopy< To, From >
• BpUGraphReader() : BpUGraphReader< _Graph, _ReaderTraits >
• BpUGraphWriter() : BpUGraphWriter< _Graph, _WriterTraits >
• bubble_down() : RadixHeap< _ItemIntMap >
• bubble_up() : RadixHeap< _ItemIntMap >
• BucketHeap() : BucketHeap< _ItemIntMap, minimize >
• build() : SecondKeyProxy , DebugMap< _Graph, _Item, _Value > , VectorMap< _Graph, _Item, _Value > , DynamicAsymMatrixMap< _FirstContainer, _FirstContainerItem, _SecondContainer, _SecondContainerItem, _Value > , ArrayMap< _Graph, _Item, _Value > , ObserverBase , AlterationNotifier< _Container, _Item > , FirstKeyProxy , DescriptorMap< _Graph, _Item >