| ConstFactorIterator typedef | opengm::FactorGraph< S, I > | |
| ConstVariableIterator typedef | opengm::FactorGraph< S, I > | |
| factorAdjacencyList(std::vector< std::set< IndexType > > &) const | opengm::FactorGraph< S, I > | inline |
| factorAdjacencyList(std::vector< RandomAccessSet< IndexType > > &) const | opengm::FactorGraph< S, I > | inline |
| factorFactorConnection(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |
| factorOfVariable(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |
| factorsOfVariableBegin(const size_t) const | opengm::FactorGraph< S, I > | inline |
| factorsOfVariableEnd(const size_t) const | opengm::FactorGraph< S, I > | inline |
| factorVariableConnection(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |
| isAcyclic() const | opengm::FactorGraph< S, I > | |
| isChain(marray::Vector< size_t > &) const | opengm::FactorGraph< S, I > | inline |
| isConnected(marray::Vector< size_t > &representatives) const | opengm::FactorGraph< S, I > | |
| isGrid(marray::Matrix< size_t > &) const | opengm::FactorGraph< S, I > | inline |
| maxFactorOrder() const | opengm::FactorGraph< S, I > | inline |
| maxFactorOrder(const size_t maxOrder) const | opengm::FactorGraph< S, I > | inline |
| numberOfFactors() const | opengm::FactorGraph< S, I > | inline |
| numberOfFactors(const size_t) const | opengm::FactorGraph< S, I > | inline |
| numberOfNthOrderFactorsOfVariable(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |
| numberOfNthOrderFactorsOfVariable(const size_t, const size_t, marray::Vector< size_t > &) const | opengm::FactorGraph< S, I > | inline |
| numberOfVariables() const | opengm::FactorGraph< S, I > | inline |
| numberOfVariables(const size_t) const | opengm::FactorGraph< S, I > | inline |
| operator S &() | opengm::FactorGraph< S, I > | inlineprotected |
| operator S const &() const | opengm::FactorGraph< S, I > | inlineprotected |
| secondVariableOfSecondOrderFactor(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |
| shortestPath(const size_t, const size_t, LIST &, const LIST &=LIST()) const | opengm::FactorGraph< S, I > | inlineprotected |
| SpecialType typedef | opengm::FactorGraph< S, I > | |
| twoHopConnected(const size_t, const size_t, LIST &) const | opengm::FactorGraph< S, I > | inlineprotected |
| variableAdjacencyList(std::vector< std::set< IndexType > > &) const | opengm::FactorGraph< S, I > | inline |
| variableAdjacencyList(std::vector< RandomAccessSet< IndexType > > &) const | opengm::FactorGraph< S, I > | inline |
| variableAdjacencyMatrix(marray::Matrix< bool > &) const | opengm::FactorGraph< S, I > | inline |
| variableFactorConnection(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |
| variableOfFactor(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |
| variablesOfFactorBegin(const size_t) const | opengm::FactorGraph< S, I > | inline |
| variablesOfFactorEnd(const size_t) const | opengm::FactorGraph< S, I > | inline |
| variableVariableConnection(const size_t, const size_t) const | opengm::FactorGraph< S, I > | inline |