Represent a node in the directed graph. The node has a (possibly empty) list of outgoing edges.
Declared in <llvm/ADT/DirectedGraph.h>
template<
class NodeType,
class EdgeType>
class DGNode;| Name | Description |
|---|---|
EdgeListTy | Ordered unique container of outgoing edge pointers. |
const_iterator | Const iterator over outgoing edges. |
iterator | Mutable iterator over outgoing edges. |
| Name | Description |
|---|---|
DGNode [constructor] | Constructors |
addEdge | Add the given edge E to this node, if it doesn't exist already. Returns true if the edge is added and false otherwise. |
back | back overloads |
begin | begin overloads |
clear | Clear the outgoing edges. |
end | end overloads |
findEdgesTo | Collect in EL, all the edges from this node to N. Return true if at least one edge was found, and false otherwise. Note that this implementation allows more than one edge to connect a given pair of nodes. |
front | front overloads |
getEdges | getEdges overloads |
hasEdgeTo | Test whether there is an edge that goes from this node to N. |
removeEdge | Remove the given edge E from this node, if it exists. |
| Name | Description |
|---|---|
findEdgeTo | Find an edge to N. If more than one edge exists, this will return the first one in the list of edges. |
getDerived | getDerived overloads |
isEqualTo | Default equality compares node object identity by address. |
| Name | Description |
|---|---|
Edges | The list of outgoing edges. |
| Name | Description |
|---|---|
llvm::operator!= | Return true if nodes M and N are not equal. |
llvm::operator== | Static polymorphism: delegate implementation (via isEqualTo) to the derived class. |