This is the complete list of members for ogdf::Graph, including all inherited members.
adjEntry_iterator typedef | ogdf::Graph | |
adjEntryRegistry() | ogdf::Graph | inline |
adjEntryRegistry() const | ogdf::Graph | inline |
allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inline |
allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inline |
chooseEdge(std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const | ogdf::Graph | |
chooseNode(std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const | ogdf::Graph | |
clear() | ogdf::Graph | virtual |
clearObservers() | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
consistencyCheck() const | ogdf::Graph | |
contract(edge e, bool keepSelfLoops=false) | ogdf::Graph | |
delEdge(edge e) | ogdf::Graph | virtual |
delNode(node v) | ogdf::Graph | virtual |
edge_iterator typedef | ogdf::Graph | |
edgeInserted(void *userData, edge original, edge copy) | ogdf::Graph | inlineprotectedvirtual |
edgeRegistry() | ogdf::Graph | inline |
edgeRegistry() const | ogdf::Graph | inline |
edges | ogdf::Graph | |
EdgeType enum name | ogdf::Graph | |
empty() const | ogdf::Graph | inline |
firstEdge() const | ogdf::Graph | inline |
firstNode() const | ogdf::Graph | inline |
genus() const | ogdf::Graph | |
getObservers() const | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
Graph() | ogdf::Graph | |
Graph(const Graph ©) | ogdf::Graph | |
Graph(Graph &&move)=delete | ogdf::Graph | |
GraphObserver class | ogdf::Graph | friend |
insert(const NI &nodesBegin, const NI &nodesEnd, const EI &edgesBegin, const EI &edgesEnd, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NI &nodesBegin, const NI &nodesEnd, const EF &edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NL &nodeList, const EdgeSet< true > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NL &nodeList, const EdgeSet< false > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NL &nodeList, const EL &edgeList, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
insert(const CCsInfo &info, int cc, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
insert(const Graph &G, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
insert(const Graph &G) | ogdf::Graph | inline |
insertAdjEntry(adjEntry oldAdj, adjEntry newAdj, Direction dir) | ogdf::Graph | inlineprivatestatic |
insertAdjEntry(node n, adjEntry newAdj, Direction dir) | ogdf::Graph | inlineprivatestatic |
insertNodes(const NI &nodesBegin, const NI &nodesEnd, NodeArray< node, true > &nodeMap, int &newNodes, void *cbData) | ogdf::Graph | private |
lastEdge() const | ogdf::Graph | inline |
lastNode() const | ogdf::Graph | inline |
m_edgeIdCount | ogdf::Graph | private |
m_hiddenEdgeSets | ogdf::Graph | private |
m_mutexRegArrays | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
m_nodeIdCount | ogdf::Graph | private |
m_regAdjArrays | ogdf::Graph | private |
m_regEdgeArrays | ogdf::Graph | private |
m_regNodeArrays | ogdf::Graph | private |
m_regObservers | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
maxAdjEntryIndex() const | ogdf::Graph | inline |
maxEdgeIndex() const | ogdf::Graph | inline |
maxNodeIndex() const | ogdf::Graph | inline |
move(edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt) | ogdf::Graph | |
moveAdj(adjEntry adjMove, Direction dir, adjEntry adjPos) | ogdf::Graph | inline |
moveAdj(adjEntry adj, node w) | ogdf::Graph | private |
moveAdjAfter(adjEntry adjMove, adjEntry adjAfter) | ogdf::Graph | inline |
moveAdjBefore(adjEntry adjMove, adjEntry adjBefore) | ogdf::Graph | inline |
moveSource(edge e, node w) | ogdf::Graph | |
moveSource(edge e, adjEntry adjSrc, Direction dir) | ogdf::Graph | |
moveTarget(edge e, node w) | ogdf::Graph | |
moveTarget(edge e, adjEntry adjTgt, Direction dir) | ogdf::Graph | |
newEdge(node v, node w, int index=-1) | ogdf::Graph | inline |
newEdge(node v, adjEntry adjTgt, int index=-1) | ogdf::Graph | inline |
newEdge(adjEntry adjSrc, node w, int index=-1) | ogdf::Graph | inline |
newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1) | ogdf::Graph | inline |
newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1) | ogdf::Graph | inline |
newNode(int index=-1) | ogdf::Graph | inline |
node_iterator typedef | ogdf::Graph | |
nodeInserted(void *userData, node original, node copy) | ogdf::Graph | inlineprotectedvirtual |
nodeRegistry() | ogdf::Graph | inline |
nodeRegistry() const | ogdf::Graph | inline |
nodes | ogdf::Graph | |
NodeType enum name | ogdf::Graph | |
numberOfEdges() const | ogdf::Graph | inline |
numberOfNodes() const | ogdf::Graph | inline |
Observable()=default | ogdf::Observable< GraphObserver, Graph > | |
Observable(const Observable ©)=delete | ogdf::Observable< GraphObserver, Graph > | |
Observable(Observable &&move)=delete | ogdf::Observable< GraphObserver, Graph > | |
Observer< TObserved, TObserver > | ogdf::Observable< GraphObserver, Graph > | private |
operator const internal::GraphAdjRegistry &() const | ogdf::Graph | inline |
operator const internal::GraphEdgeRegistry &() const | ogdf::Graph | inline |
operator const internal::GraphNodeRegistry &() const | ogdf::Graph | inline |
operator=(const Graph ©) | ogdf::Graph | |
operator=(Graph &&move)=delete | ogdf::Graph | |
Observable< GraphObserver, Graph >::operator=(const Observable ©)=delete | ogdf::Observable< GraphObserver, Graph > | |
Observable< GraphObserver, Graph >::operator=(Observable &&move)=delete | ogdf::Observable< GraphObserver, Graph > | |
postInsert(void *userData, int newNodes, int newEdges) | ogdf::Graph | inlineprotectedvirtual |
preInsert(bool copyEmbedding, bool copyIDs, bool notifyObservers, bool edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap, int *newNodes, int *newEdges) | ogdf::Graph | inlineprotectedvirtual |
pureNewEdge(node src, node tgt, int index) | ogdf::Graph | inlineprivate |
pureNewNode(int index) | ogdf::Graph | inlineprivate |
registerObserver(GraphObserver *obs) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
representsCombEmbedding() const | ogdf::Graph | inline |
resetEdgeIdCount(int maxId) | ogdf::Graph | |
resetNodeIdCount(int maxId) | ogdf::Graph | |
restoreAllEdges() | ogdf::Graph | |
reverseAdjEdges(node v) | ogdf::Graph | inline |
reverseAdjEdges() | ogdf::Graph | |
reverseAllEdges() | ogdf::Graph | |
reverseEdge(edge e) | ogdf::Graph | |
searchEdge(node v, node w, bool directed=false) const | ogdf::Graph | |
sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
sort(node v, IT begin, IT end) | ogdf::Graph | inline |
split(edge e) | ogdf::Graph | virtual |
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | inline |
unregisterObserver(typename ListPure< GraphObserver * >::iterator it) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
unsplit(node u) | ogdf::Graph | |
unsplit(edge eIn, edge eOut) | ogdf::Graph | virtual |
~Graph() | ogdf::Graph | virtual |
~Observable() | ogdf::Observable< GraphObserver, Graph > | inlinevirtual |