- b -

• back() : opengm::FastSequence< T, MAX_STACK >
• begin() : opengm::FastSequence< T, MAX_STACK > , opengm::RandomAccessSet< Key, Compare, Alloc > , opengm::SparseMarray< T_AssociativeContainer > , marray::View< T, isConst, A > , opengm::SparseMarray< T_AssociativeContainer > , opengm::GibbsMarginalVisitor< GIBBS > , opengm::FastSequence< T, MAX_STACK > , marray::View< T, isConst, A > , opengm::RandomAccessSet< Key, Compare, Alloc >
• bop() : opengm::Minimizer , opengm::Or , opengm::And , opengm::Integrator , opengm::Maximizer
• bound() : opengm::DualDecompositionSubGradient< GM, INF, DUALBLOCK > , opengm::LPCplex< GM, ACC > , opengm::DualDecomposition< GM, ACC, DUALSOLVER > , opengm::ReducedInference< GM, ACC, INF > , opengm::DualDecomposition< GM, ACC, DUALSOLVER > , opengm::DualDecompositionMerit< GM, INF, DUALBLOCK > , opengm::AStar< GM, ACC > , opengm::DualDecomposition< GM, ACC, DUALSOLVER > , opengm::Inference< GM, ACC >
• bounds() : opengm::DualDecompositionVisitor< DD >
• boundView() : marray::View< T, isConst, A >
• Bruteforce() : opengm::Bruteforce< GM, ACC >