Overview     Modules     Class Hierarchy     Classes     Members  

tlp::GraphStorage Member List

This is the complete list of members for tlp::GraphStorage, including all inherited members.
addEdge(const node src, const node tgt, const edge e, bool updateEndsEdges)tlp::GraphStorage
addEdge(node src, node tgt)tlp::GraphStorage
addEdges(const std::vector< std::pair< node, node > > &edges, std::vector< edge > &addedEdges)tlp::GraphStorage
addNode(node n)tlp::GraphStorage
addNode()tlp::GraphStorage
addNodes(unsigned int nb, std::vector< node > &addedNodes)tlp::GraphStorage
clear()tlp::GraphStorage
deg(node n) const tlp::GraphStorage
delAllEdges()tlp::GraphStorage
delAllNodes()tlp::GraphStorage
delEdge(edge e)tlp::GraphStorage
delNode(node n)tlp::GraphStorage
ends(const edge e) const tlp::GraphStorage
getEdges() const tlp::GraphStorage
getIdsMemento()tlp::GraphStorage
getInEdges(node n) const tlp::GraphStorage
getInNodes(node n) const tlp::GraphStorage
getInOutEdges(node n) const tlp::GraphStorage
getInOutNodes(node n) const tlp::GraphStorage
getNodes() const tlp::GraphStorage
getOneNode() const tlp::GraphStorage
getOutEdges(node n) const tlp::GraphStorage
getOutNodes(node n) const tlp::GraphStorage
GraphStorage()tlp::GraphStorage
indeg(node n) const tlp::GraphStorage
isElement(const node n) const tlp::GraphStorage
isElement(const edge e) const tlp::GraphStorage
numberOfEdges() const tlp::GraphStorage
numberOfNodes() const tlp::GraphStorage
opposite(edge e, node n) const tlp::GraphStorage
outdeg(node n) const tlp::GraphStorage
removeFromNodes(const node n)tlp::GraphStorage
reserveAdj(node n, size_t nb)tlp::GraphStorage
reserveAdj(size_t nb)tlp::GraphStorage
reserveEdges(size_t nb)tlp::GraphStorage
reserveNodes(size_t nb)tlp::GraphStorage
restoreAdj(node n, std::vector< edge > &edges)tlp::GraphStorage
restoreEdges(const std::vector< edge > &edgesToRestore, const std::vector< std::pair< node, node > > &ends)tlp::GraphStorage
restoreIdsMemento(const GraphStorageIdsMemento *)tlp::GraphStorage
restoreNodes(const std::vector< node > &addedNodes)tlp::GraphStorage
reverse(const edge e)tlp::GraphStorage
setEdgeOrder(const node n, const std::vector< edge > &v)tlp::GraphStorage
setEnds(const edge e, const node newSrc, const node newTgt)tlp::GraphStorage
setSource(const edge e, const node n)tlp::GraphStorage
setTarget(const edge e, const node n)tlp::GraphStorage
source(edge e) const tlp::GraphStorage
swapEdgeOrder(const node n, const edge e1, const edge e2)tlp::GraphStorage
target(edge e) const tlp::GraphStorage
~GraphStorage()tlp::GraphStorage


Tulip Software by LaBRI Visualization Team    2001 - 2011