[ ligand_pharma | Source | Keywords | Summary | Ancestors | All Members | Descendants ]
public: | |
BipartiteMatcher(unsigned int m, unsigned int n) ; | |
void | addEdge(unsigned int ai, unsigned int bj, double weight ); |
void | removeEdge(unsigned int ai, unsigned int bj); |
void | updateEdge(unsigned int ai, unsigned int bj, float w); |
template< class MatchT> void | calculateMatch(MatchT& match); |
void | getMatch(ScoredMatchedList& match) ; |
float | getScore() ; |
unsigned int | calculateMatch() ; |
void | update(); |
void | clearEdges() ; |
protected: | |
BipartiteGraph | bipartiteGraph_; |
::list< | leda::node> setA_, setB_; |
vector< | leda::node> id2nodeSetA_, id2nodeSetB_; |
unsigned int sizeA_, | sizeB_; |
::list< | leda::edge> matchEdges_; |
bool | isMatchUpdated_; |
Back to the top of BipartiteMatcher
Back to the top of BipartiteMatcher
Back to the top of BipartiteMatcher
Back to the top of BipartiteMatcher
Back to the top of BipartiteMatcher
Back to the top of BipartiteMatcher
BipartiteMatcher(unsigned int m, unsigned int n) ;
m,n are the sizes of each set
BipartiteMatcher(unsigned int m, unsigned int n) ;
Function is currently defined inline.
Back to the top of BipartiteMatcher
void addEdge(unsigned int ai, unsigned int bj, double weight );
void addEdge(unsigned int ai, unsigned int bj, double weight = 1.0);
Back to the top of BipartiteMatcher
void removeEdge(unsigned int ai, unsigned int bj);
void removeEdge(unsigned int ai, unsigned int bj);
Back to the top of BipartiteMatcher
void updateEdge(unsigned int ai, unsigned int bj, float w);
void updateEdge(unsigned int ai, unsigned int bj, float w);
Back to the top of BipartiteMatcher
template< class MatchT> void calculateMatch(MatchT& match);
template< class MatchT> void calculateMatch(MatchT& match);
Back to the top of BipartiteMatcher
void getMatch(ScoredMatchedList& match) ;
void getMatch(ScoredMatchedList& match) ;
Function is currently defined inline.
Back to the top of BipartiteMatcher
float getScore() ;
Function is currently defined inline.
Back to the top of BipartiteMatcher
unsigned int calculateMatch() ;
unsigned int calculateMatch() ;
Function is currently defined inline.
Back to the top of BipartiteMatcher
void update();
Back to the top of BipartiteMatcher
void clearEdges() ;
Function is currently defined inline.
Back to the top of BipartiteMatcher
BipartiteGraph bipartiteGraph_;
BipartiteGraph bipartiteGraph_;
Back to the top of BipartiteMatcher
::list< leda::node> setA_, setB_;
leda::list< leda::node> setA_, setB_;
Back to the top of BipartiteMatcher
vector< leda::node> id2nodeSetA_, id2nodeSetB_;
vector< leda::node> id2nodeSetA_, id2nodeSetB_;
Back to the top of BipartiteMatcher
unsigned int sizeA_, sizeB_;
Back to the top of BipartiteMatcher
::list< leda::edge> matchEdges_;
leda::list< leda::edge> matchEdges_;
Back to the top of BipartiteMatcher
bool isMatchUpdated_;
Back to the top of BipartiteMatcher
public: | ||
---|---|---|
void | addEdge(unsigned int ai, unsigned int bj, double weight ); | |
void | removeEdge(unsigned int ai, unsigned int bj); | |
void | updateEdge(unsigned int ai, unsigned int bj, float w); | |
template< class MatchT> void | calculateMatch(MatchT& match); | |
void | getMatch(ScoredMatchedList& match) ; | |
float | getScore() ; | |
unsigned int | calculateMatch() ; | |
void | update(); | |
void | clearEdges() ; | |
protected: | ||
BipartiteGraph | bipartiteGraph_; | |
::list< | leda::node> setA_, setB_; | |
vector< | leda::node> id2nodeSetA_, id2nodeSetB_; | |
unsigned int sizeA_, | sizeB_; | |
::list< | leda::edge> matchEdges_; | |
bool | isMatchUpdated_; |
Back to the top of BipartiteMatcher
Back to the top of BipartiteMatcher
Back to the top of BipartiteMatcher
Report problems to jkotula@unimax.com