digraph G {
  ordering=out; 
  node_0 [label="0", shape=circle, height=0.1, width=0.1];
  edge_0 [label="e | probability:\ 0.94\l", shape=record]; 
  node_0 -> edge_0; 
  edge_0 -> node_1; 
  node_1 [label="1", shape=circle, height=0.1, width=0.1]; 
  edge_1 [label="v | probability:\ 0.85\l", shape=record]; 
  node_1 -> edge_1; 
  edge_1 -> node_2; 
  node_2 [label="2", shape=circle, height=0.1, width=0.1]; 
  edge_2 [label="e | probability:\ 0.92\l", shape=record]; 
  node_2 -> edge_2; 
  edge_2 -> node_3; 
  edge_3 [label="w | probability:\ 0.24\l", shape=record]; 
  node_2 -> edge_3; 
  edge_3 -> node_4; 
  node_3 [label="3", shape=circle, height=0.1, width=0.1]; 
  edge_4 [label="r | probability:\ 0.78\l", shape=record]; 
  node_3 -> edge_4; 
  edge_4 -> node_4; 
  node_4 [label="4", shape=circle, height=0.1, width=0.1];
}