digraph G
{
  edge [fontname="FreeSans",fontsize="10",labelfontname="FreeSans",labelfontsize="10"];
  node [fontname="FreeSans",fontsize="10",shape=record];
  rankdir=LR;
  Node1 [label="inverseNum",height=0.2,width=0.4,color="black", fillcolor="grey75", style="filled" fontcolor="black"];
  Node1 -> Node2 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node2 [label="inverseNode",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$node_8hh.html#a533df2f8501fde80c07a7ec9d79ebdaf"];
  Node2 -> Node3 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node3 [label="divNode",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$node_8hh.html#ae5a3df17f83e065ebc1b2db960b943ba"];
  Node3 -> Node4 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node4 [label="isDouble",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$node_8hh.html#aab6c20fb5dce797e97ac8ec8591258af"];
  Node4 -> Node5 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node5 [label="Node::type",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$classNode.html#aff078c9f1e1673b275e4eab069fb34b6"];
  Node1 -> Node6 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node6 [label="CTree::node",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$classCTree.html#a8de786fec095c8304b9ffa7c1c316237",tooltip="return the content of the tree"];
  Node1 -> Node7 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node7 [label="tree",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$tree_8hh.html#a61c13e9361cfa80bbb3cd6ce60a8f595"];
  Node7 -> Node8 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node8 [label="CTree::make",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$classCTree.html#a3184c572cef05308f59e36ea2bdf537e",tooltip="return a new tree or an existing equivalent one"];
}