structedge__coll__graph.dot

Aprior的C++实现算法

digraph G
{
  edge [fontname="Helvetica",fontsize=10,labelfontname="Helvetica",labelfontsize=10];
  node [fontname="Helvetica",fontsize=10,shape=record];
  Node1 [label="Edge",height=0.2,width=0.4,color="white", fillcolor="black", style="filled" fontcolor="white"];
  Node2 -> Node1 [dir=back,color="darkorchid3",fontsize=10,style="dashed",label="subtrie",fontname="Helvetica"];
  Node2 [label="Trie",height=0.2,width=0.4,color="black",URL="$classTrie.html"];
  Node2 -> Node2 [dir=back,color="darkorchid3",fontsize=10,style="dashed",label="parent",fontname="Helvetica"];
}