Graph, conform to GXL, uses Edge and Node

Inheritance:

Public Fields

map<string,int>	edge_idx map from edge string-id to its index
map<string,int>	node_idx map from node string-id to its index
map<string,int>	rel_idx map from rel string-id to its index
map<int,set<int> >	from_to_map adjacent list, state_id -> edge_1_id, edge_2_id, edge_3_id,
map<int,set<int> >	to_from_map inverse adjacent list, state_id -> edge_1_id, edge_2_id, edge_3_id,

Public Methods

	gxl_graph ()
	gxl_graph (const string& id)
	gxl_graph (const string& tag, XMLIO_Attributes &attributes)
virtual XMLIO_Element*	XMLIO_startTag (const string& tag, XMLIO_Attributes &attributes) expected elements are: gxl_graph, Initial, Emissions and Sequences
virtual void	XMLIO_endTag (const string& tag)
virtual void	XMLIO_getCharacters (const string& characters)
virtual void	XMLIO_finishedReading ()
virtual const char*	toString () const Returns name of class.
virtual void	print () const dumps all content to cout
virtual int	get_node_idx (const string& node_id) const
virtual int	exists_node (const string& node_id) const
virtual int	replace_node (gxl_node* node) replace the node with the same id by this one.
virtual int	update_node (gxl_node* node) replace or add the node identified by id
virtual int	add_node (gxl_node* node)
virtual int	remove_node (const string& node_id)
virtual void	reorganize_graph () regenerates the maps and (inverse) adjacent lists
virtual int	get_edge_idx (const string& edge_id) const
virtual int	exists_edge (const string& edge_id) const
virtual int	add_edge (gxl_edge* edge)
virtual int	remove_edge (const string& edge_id)
virtual set<int> &	get_to_from_transitions (int state_id)
virtual set<int> &	get_from_to_transitions (int state_id)
virtual set<int> &	get_to_from_transitions (const string& state_id)
virtual set<int> &	get_from_to_transitions (const string& state_id)
virtual const XMLIO_Attributes&	XMLIO_getAttributes () const
virtual const int	XMLIO_writeContent (XMLIO_Document& writer) const
void	dumpInternalState () const dumps all internal lists and maps to cerr

Protected Methods

void	add_from_to (int edge_pos, int from_idx, int to_idx) adds edge (given as edge vector index) to both adjacent lists
void	remove_from_to (int edge_pos, int from_idx, int to_idx) removes edge (given as edge vector index) to both adjacent lists

Inherited from gxl_typedElement:

Public Fields

vector<gxl_attr*> my_attrs

gxl_type* my_type

string id

Private Methods

void init_members()

Inherited from XMLIO_Element:

Public Fields

XMLIO_string tag

XMLIO_Attributes attributes

XMLIO_IndentationType xmlio_indent_type

Public Methods

virtual void XMLIO_getComment(const XMLIO_string& comment)

virtual void XMLIO_getProcessingInstruction(const XMLIO_string& target, const XMLIO_string& instructions)

virtual bool XMLIO_remove() const

virtual const XMLIO_string& XMLIO_getName() const

virtual bool XMLIO_isEmpty() const

Documentation

Graph, conform to GXL, uses Edge and Node

gxl_graph()

gxl_graph(const string& id)

gxl_graph(const string& tag, XMLIO_Attributes &attributes)

virtual XMLIO_Element* XMLIO_startTag(const string& tag, XMLIO_Attributes &attributes)

expected elements are: gxl_graph, Initial, Emissions and Sequences

virtual void XMLIO_endTag(const string& tag)

virtual void XMLIO_getCharacters(const string& characters)

virtual void XMLIO_finishedReading()

virtual const char* toString() const

Returns name of class.

virtual void print() const

dumps all content to cout

virtual int get_node_idx(const string& node_id) const

Returns:

-1 if node does not exist

virtual int exists_node(const string& node_id) const

Returns:

true if this id exists, false if it does not exist or is not valid

virtual int replace_node(gxl_node* node)

replace the node with the same id by this one. The old one is deleted.

Returns:

-1 if there is no node with the same id

virtual int update_node(gxl_node* node)

replace or add the node identified by id

Returns:

index of the node

virtual int add_node(gxl_node* node)

Returns:

-1 if there is allready a node of same id

virtual int remove_node(const string& node_id)

Returns:

returns the node of the deleted edge, -1 if there was no node to delete, or an edge refers to this node

virtual void reorganize_graph()

regenerates the maps and (inverse) adjacent lists

virtual int get_edge_idx(const string& edge_id) const

Returns:

-1 if edge does not exist

virtual int exists_edge(const string& edge_id) const

Returns:

true if this id exists, false if it does not exist or is not valid

virtual int add_edge(gxl_edge* edge)

Returns:

-1 if there is allready a node of same id

virtual int remove_edge(const string& edge_id)

Returns:

returns the index of the deleted edge, -1 if there was no edge to delete

virtual set<int> & get_to_from_transitions(int state_id)

virtual set<int> & get_from_to_transitions(int state_id)

virtual set<int> & get_to_from_transitions(const string& state_id)

virtual set<int> & get_from_to_transitions(const string& state_id)

virtual const XMLIO_Attributes& XMLIO_getAttributes() const

virtual const int XMLIO_writeContent(XMLIO_Document& writer) const

void dumpInternalState() const

dumps all internal lists and maps to cerr

void add_from_to(int edge_pos, int from_idx, int to_idx)

adds edge (given as edge vector index) to both adjacent lists

void remove_from_to(int edge_pos, int from_idx, int to_idx)

removes edge (given as edge vector index) to both adjacent lists

map<string,int> edge_idx

map from edge string-id to its index

map<string,int> node_idx

map from node string-id to its index

map<string,int> rel_idx

map from rel string-id to its index

map<int,set<int> > from_to_map

adjacent list, state_id -> edge_1_id, edge_2_id, edge_3_id,

map<int,set<int> > to_from_map

inverse adjacent list, state_id -> edge_1_id, edge_2_id, edge_3_id,

This class has no child classes.

Alphabetic index HTML hierarchy of classes or Java