[#llvm-GraphTraits-058]
= xref:llvm.adoc[llvm]::xref:llvm/GraphTraits-061.adoc[GraphTraits]<xref:llvm/DDGNode.adoc[DDGNode] const*>
:relfileprefix: ../
:mrdocs:

GraphTraits specialization for const DDGNode pointers.

== Synopsis

Declared in `<llvm/Analysis/DDG.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<>
struct xref:llvm/GraphTraits-061.adoc[GraphTraits]<xref:llvm/DDGNode.adoc[DDGNode] const*>;
----

== Type Aliases

[cols="1,4"]
|===
| Name| Description
| xref:llvm/GraphTraits-058/ChildEdgeIteratorType.adoc[`ChildEdgeIteratorType`] 
| Iterator over outgoing const DDG edges.
| xref:llvm/GraphTraits-058/ChildIteratorType.adoc[`ChildIteratorType`] 
| Iterator over child const DDGNode pointers.
| xref:llvm/GraphTraits-058/NodeRef.adoc[`NodeRef`] 
| Graph node type for a const DDGNode.
|===


== Static Member Functions

[cols="1,4"]
|===
| Name| Description
| xref:llvm/GraphTraits-058/DDGGetTargetNode.adoc[`DDGGetTargetNode`] 
| Return the target node of edge `P.`
| xref:llvm/GraphTraits-058/child_begin.adoc[`child_begin`] 
| Return the begin iterator over children of `N.`
| xref:llvm/GraphTraits-058/child_edge_begin.adoc[`child_edge_begin`] 
| Return the begin iterator over outgoing edges of `N.`
| xref:llvm/GraphTraits-058/child_edge_end.adoc[`child_edge_end`] 
| Return the end iterator over outgoing edges of `N.`
| xref:llvm/GraphTraits-058/child_end.adoc[`child_end`] 
| Return the end iterator over children of `N.`
| xref:llvm/GraphTraits-058/getEntryNode.adoc[`getEntryNode`] 
| Return `N` as the graph entry node.
|===


== Derived Classes

[cols="1,4"]
|===
| Name| Description
| xref:llvm/GraphTraits-0510.adoc[`GraphTraits<DataDependenceGraph const*>`] 
| GraphTraits specialization treating a const DataDependenceGraph as a graph of nodes.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#