#include <graph_can_code.h>
Public Types | |
typedef int | STORAGE_TYPE |
typedef five_tuple< V_T, E_T > | FIVE_TUPLE |
typedef FIVE_TUPLE | INIT_TYPE |
typedef eqint | COMPARISON_FUNC |
typedef vector< FIVE_TUPLE, ALLOC< FIVE_TUPLE > > | TUPLES |
typedef TUPLES::const_iterator | CONST_IT |
typedef TUPLES::iterator | IT |
typedef canonical_code< GRAPH_PROP, V_T, E_T, ALLOC > | CAN_CODE |
typedef HASHNS::hash_map< int, int, HASHNS::hash< int >, std::equal_to< int >, ALLOC< int > > | VID_HMAP |
typedef VID_HMAP::const_iterator | VM_CONST_IT |
typedef vector< int, ALLOC< int > > | RMP_T |
Public Member Functions | |
canonical_code (const FIVE_TUPLE &ft, const int &gi, const int &gj) | |
IT | begin () |
CONST_IT | begin () const |
IT | end () |
CONST_IT | end () const |
int | size () const |
void | clear () |
const FIVE_TUPLE & | operator[] (const int &index) const |
void | init_rmp () |
void | update_rmp (const FIVE_TUPLE &tuple) |
template<class PAT> | |
void | init (const INIT_TYPE &tuple, PAT *pattern) |
void | push_back (const FIVE_TUPLE &tuple) |
void | append (const FIVE_TUPLE &tuple) |
void | append (const FIVE_TUPLE &tuple, const int &gi, const int &gj) |
void | update_code () |
STORAGE_TYPE | getCode () const |
bool | operator< (const CAN_CODE &rhs) const |
int | cid (const int &gi) const |
int | gid (const int &ci) const |
RMP_T & | rmost_path () |
void | append_rmp (const int &id) |
Friends | |
ostream & | operator<< (ostream &, const canonical_code< GRAPH_PROP, V_T, E_T, ALLOC > &) |
pattern_prop is set to undirected (graph property)
canonical_code< GRAPH_PROP, V_T, E_T, ALLOC >::canonical_code | ( | const FIVE_TUPLE & | ft, | |
const int & | gi, | |||
const int & | gj | |||
) | [inline] |
Parameterized constructor that inserts ft as first tuple into DFS code