SimBiGraph Member ListThis is the complete list of members for SimBiGraph, including all inherited members.
| _add_corresp_edge_backward(SimilarityType type, int index_old, int index_mid, int index_new, Array< int > *stride_match, Array< bool > *span_match) | SimBiGraph | |
| _add_corresp_edge_forward(SimilarityType type, int index_new, int index_mid, int index_old, Array< int > *stride_match, Array< bool > *span_match) | SimBiGraph | |
| _flags | Listable | [protected] |
| _graph | SimBiGraph | [protected] |
| _nodes1 | SimBiGraph | [protected] |
| _nodes2 | SimBiGraph | [protected] |
| _ptrs1 | SimBiGraph | [protected] |
| _ptrs2 | SimBiGraph | [protected] |
| _range_acc | SimBiGraph | [protected] |
| assert_free() | Listable | [inline] |
| calc_similarity(int node1, int node2) | SimBiGraph | |
| clone() const | SimBiGraph | [virtual] |
| fingerprint_ok() | Listable | [inline] |
| kernel(int i, int j) | SimBiGraph | |
| Listable() | Listable | |
| listable_clone() const | SimBiGraph | [virtual] |
| next_ref() const | Listable | |
| nodes1() | SimBiGraph | |
| nodes2() | SimBiGraph | |
| operator delete(void *ptr, unsigned int size) | Listable | |
| operator new(unsigned int size) | Listable | |
| operator<<(ostream &o, const SimBiGraph &ad) | SimBiGraph | [friend] |
| prev_ref() const | Listable | |
| print(ostream &o) const | SimBiGraph | [virtual] |
| print_similarities() const | SimBiGraph | |
| range_acc() | SimBiGraph | |
| redo_spanmatch(SimEdge &edge, int which_node, int which_dim) | SimBiGraph | |
| SimBiGraph() | SimBiGraph | |
| SimBiGraph(const SimBiGraph &) | SimBiGraph | |
| SimBiGraph(List< AbstractAccess > &list1, List< AbstractAccess > &list2) | SimBiGraph | |
| SimBiGraphIterator class | SimBiGraph | [friend] |
| ~Listable() | Listable | [virtual] |
| ~SimBiGraph() | SimBiGraph | |
|