| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
tlp::GraphStorage Class Reference That class provide a simple implementation for the storage of graph elts (nodes edges) More...
Detailed DescriptionThat class provide a simple implementation for the storage of graph elts (nodes edges) Constructor & Destructor Documentation
Member Function Documentation
Add the given edge between src and tgt and return it the last argument indicates if the edge has to be added in the adjacency edges of its two ends.
Add a new edge between src and tgt and return it.
Add edges in the structure and returns them in the addedEdges vector.
Add the given node in the structure and return it.
Add a new node in the structure and return it.
Add nb new nodes in the structure and returns them in the addedNodes vector.
Return the degree of a node.
Delete all edges in the graph.
Delete all nodes in the graph.
Delete an edge in the graph.
Delete a node and all its adjacent edges in the graph.
Return the extremities of an edge (src, target) Return a Tulip Iterator on edges of the graph.
Return the current state of the ids management must be deleted by the caller this can be used for push/pop. Return a Tulip Iterator on in edges of the node n.
Return a Tulip Iterator on in nodes of the node n.
Return a Tulip Iterator on adjacent edges of the node n.
Return a Tulip Iterator on adjacent nodes of the node n.
Return a Tulip Iterator on nodes of the graph.
Return the first node of graph. Return a Tulip Iterator on out edges of the node n.
Return a Tulip Iterator on out nodes of the node n.
Return the in degree of a node.
Return true if n belongs to the graph.
Return true if e belongs to the graph.
Return the number of edges in the graph.
Return the number of nodes in the graph. return the opposite node of n through edge e
Return the out degree of a node.
remove a node from the nodes structure only
Enables to reserve memory for adjacency nodes Reserving memory before to addEdge enable to reduce the number of vector resizing and then to speed up significantly construction of graphs.
Enables to reserve memory for adjacency nodes Reserving memory before to addEdge enable to reduce the number of vector resizing and then to speed up significantly construction of graphs.
Enables to reserve memory for nbEdges Reserving memory before to addEdge enable to reduce the number of vector resizing and then to speed up significantly construction of graphs.
Enables to reserve memory for nbNodes Reserving memory before to addNode enable to reduce the number of vector resizing and then to speed up significantly construction of graphs. restore adjacency edges of a given node
restore edges in the structure and returns them in the addedEdges vector
restore a state of the ids management
Add the given nodes in the structure.
Reverse an edge e, source become target and target become soure. Set the ordering of edges around n according to their order in v. Reconnect the edge e to have the new given ends.
change the source of an edge
change the target of an edge
return the first extremity (considered as source if the graph is directed) of an edge swap to edge in the ordered adjacency vector
|
Tulip Software by LaBRI Visualization Team 2001 - 2012 |