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. |
back | back overloads |
begin | begin overloads |
clear | Clear the outgoing edges. |
end | end overloads |
findEdgesTo | Collect all edges from this node to N into EL. |
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 LHS and RHS are not equal. |
llvm::operator== | Compare two stream references for equality of impl, offset, and length. |