NetFile v10 {
  GlobalParam {
    label_font:"Dialog",1,11
  }
  Bubble 0 (7,5) 10,10 {
    label:"a"
    children:1,7,12
  }
  Bubble 0 (11,10) 10,10 {
    label:"f"
    label_offset:-7,0
    children:11,3,2,6,10
  }
  Bubble 0 (15,6) 10,10 {
    label:"c"
    children:6,12
  }
  Bubble 0 (17,15) 10,10 {
    label:"i"
    children:14,11
  }
  Bubble 0 (7,21) 10,10 {
    label:"k"
    label_offset:-11,1
    children:10,5
  }
  Bubble 0 (13,20) 10,10 {
    label:"l"
    children:15
  }
  Bubble 0 (18,11) 10,10 {
    label:"g"
    children:3,1,16
  }
  Bubble 0 (3,4) 10,10 {
    label:"b"
    children:0,9
  }
  Bubble 0 (2,17) 10,10 {
    label:"h"
    children:4
  }
  Bubble 0 (2,12) 10,10 {
    label:"d"
    label_offset:-6,1
    children:10,7
  }
  Bubble 0 (6,11) 10,10 {
    label:"e"
    label_offset:-7,1
    children:0,1,8,11,9,4
  }
  Bubble 0 (10,16) 10,10 {
    label:"j"
    label_offset:-7,-1
    children:4,5,3,1
  }
  Bubble 0 (11,4) 10,10 {
    label:"q"
    label_offset:-12,33
    children:1
  }
  Bubble 0 (19,5) 10,10 {
    label:"p"
    children:2
  }
  Bubble 0 (23,14) 10,10 {
    label:"n"
    label_offset:6,1
    children:15,16,3
  }
  Bubble 0 (18,19) 10,10 {
    label:"m"
    label_offset:-16,5
    children:3
  }
  Bubble 0 (22,8) 10,10 {
    label:"o"
    label_offset:0,1
    children:13
  }
  Text 0 (109,401) {
    label:"This application demonstrate how to use the NetEditor to implement a ",
          "Dijkstra path finding algorithm :",
          "  Left mouse click on a bubble to select the source.",
          "  Right mouse click on a bubble to select the destination.",
          "  You can drag object and see the evolution of the path."
    label_offset:-56,-28
    justify:0
    font:"Dialog",0,12
  }
  Text 0 (273,62) {
    label:"'Find the shortest path'"
    label_offset:-48,-30
    font:"Serif",1,23
  }
}