- Member dai::BipartiteGraph::add1 ()
- Please use dai::BipartiteGraph::addNode1() instead.
- Member dai::BipartiteGraph::add2 ()
- Please use dai::BipartiteGraph::addNode2() instead.
- Member dai::BipartiteGraph::add1 (NodeInputIterator begin, NodeInputIterator end, size_t sizeHint=0)
- Please use dai::BipartiteGraph::addNode1( NodeInputIterator, NodeInputIterator, size_t) instead.
- Member dai::BipartiteGraph::add2 (NodeInputIterator begin, NodeInputIterator end, size_t sizeHint=0)
- Please use dai::BipartiteGraph::addNode2( NodeInputIterator, NodeInputIterator, size_t) instead.
- Member dai::BipartiteGraph::erase1 (size_t n1)
- Please use dai::BipartiteGraph::eraseNode1(size_t) instead.
- Member dai::BipartiteGraph::erase2 (size_t n2)
- Please use dai::BipartiteGraph::eraseNode2(size_t) instead.
- Member dai::BipartiteGraph::nr1 () const
- Please use dai::BipartiteGraph::nrNodes1() instead.
- Member dai::BipartiteGraph::nr2 () const
- Please use dai::BipartiteGraph::nrNodes2() instead.
- Member dai::ClusterGraph::eliminationCost (size_t i) const
- Please use dai::eliminationCost_MinFill() instead.
- Member dai::ClusterGraph::VarElim (const std::vector< Var > &ElimSeq) const
- Please use dai::ClusterGraph::VarElim( sequentialVariableElimination( ElimSeq ) ) instead.
- Member dai::ClusterGraph::VarElim_MinFill () const
- Please use dai::ClusterGraph::VarElim( greedyVariableElimination( eliminationCost_MinFill ) ) instead.
- Member dai::RegionGraph::RegionGraph (const FactorGraph &fg, const std::vector< Region > &ors, const std::vector< Region > &irs, const std::vector< std::pair< size_t, size_t > > &edges)
- Please use dai::RegionGraph::RegionGraph( const FactorGraph &, const std::vector<VarSet> &, const std::vector<Region> &, const std::vector<std::pair<size_t,size_t> > & ) instead.
- Member dai::Graph
- Please use dai::GraphEL instead.
Generated on Thu Feb 11 12:26:01 2010 for libDAI by
1.5.5