digraph G
{
  edge [fontname="FreeSans",fontsize="10",labelfontname="FreeSans",labelfontsize="10"];
  node [fontname="FreeSans",fontsize="10",shape=record];
  rankdir=LR;
  Node1 [label="Klass::printLoopGraphOpenMP",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="computeUseCount",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8",tooltip="Compute how many time each loop is used in a DAG."];
  Node1 -> Node3 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node3 [label="groupSeqLoops",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8",tooltip="Group together sequences of loops."];
  Node3 -> Node4 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node4 [label="Loop::concat",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$structLoop.html#a11c5adcd88f4c8fabbaa9f6feae5a8f7"];
  Node1 -> Node5 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node5 [label="Klass::printLoopLevelOpenMP",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$classKlass.html#ab8f2345eeb6f48acd72b5582f1741bdb",tooltip="Print the 'level' of the loop graph as a set of parallel loops."];
  Node5 -> Node6 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node6 [label="nonRecursiveLevel",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$klass_8cpp.html#a35ee3fbf2966df0dcc60bde5e8febf73",tooltip="returns true if all the loops are non recursive"];
  Node5 -> Node7 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node7 [label="tab",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e"];
  Node1 -> Node8 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node8 [label="sortGraph",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$graphSorting_8cpp.html#a964ca1ea63e1352afbb27da72220e024",tooltip="Topological sort of an acyclic graph of loops."];
  Node8 -> Node9 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node9 [label="resetOrder",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$graphSorting_8cpp.html#a8a3374eca50150e65ab9c2e0cf930506"];
  Node8 -> Node10 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node10 [label="setLevel",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$graphSorting_8cpp.html#ae24e6b80c2ad54f934202fde9e96785b",tooltip="Set the order of T1's loops and collect there sons into T2."];
  Node10 -> Node11 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
  Node11 [label="setOrder",height=0.2,width=0.4,color="black", fillcolor="white", style="filled",URL="$graphSorting_8cpp.html#a24fd2d00ad9caf583ee03106b9138c3a",tooltip="Set the order of a loop and place it to appropriate set."];
  Node1 -> Node7 [color="midnightblue",fontsize="10",style="solid",fontname="FreeSans"];
}