| _add_corresp_edge_backward(SimilarityType type, int index_old, int index_mid, int index_new, Array< int > *stride_match, Array< bool > *span_match) | SimGraph | |
| _add_corresp_edge_forward(SimilarityType type, int index_new, int index_mid, int index_old, Array< int > *stride_match, Array< bool > *span_match) | SimGraph | |
| _descr_exists | SimGraph | [protected] |
| _flags | Listable | [protected] |
| _graph | SimGraph | [protected] |
| _nodes | SimGraph | [protected] |
| _ptrs | SimGraph | [protected] |
| _range_acc | SimGraph | [protected] |
| assert_free() | Listable | [inline] |
| calc_similarity(int node1, int node2) | SimGraph | |
| clone() const | SimGraph | [virtual] |
| fingerprint_ok() | Listable | [inline] |
| kernel(int i, int j) | SimGraph | |
| Listable() | Listable | |
| listable_clone() const | SimGraph | [virtual] |
| next_ref() const | Listable | |
| nodes() | SimGraph | |
| operator delete(void *ptr, unsigned int size) | Listable | |
| operator new(unsigned int size) | Listable | |
| operator<<(ostream &o, const SimGraph &ad) | SimGraph | [friend] |
| prev_ref() const | Listable | |
| print(ostream &o) const | SimGraph | [virtual] |
| print_similarities() const | SimGraph | |
| range_acc() | SimGraph | |
| redo_spanmatch(SimEdge &edge, int which_node, int which_dim) | SimGraph | |
| set_ptr(int i, AbstractAccess &aa) | SimGraph | |
| set_unknown(SimEdge &edge, int which_node) | SimGraph | |
| SimGraph() | SimGraph | |
| SimGraph(const SimGraph &) | SimGraph | |
| SimGraph(List< AbstractAccess > &list) | SimGraph | |
| SimGraphIterator class | SimGraph | [friend] |
| ~Listable() | Listable | [virtual] |
| ~SimGraph() | SimGraph | |