core :: union_find
union–find algorithm using an efficient disjoint-set data structure
# Example from http://www.graphviz.org/content/hello
module hello is example
import dot
var graph = new DotGraph("G", "digraph")
var hello = graph.add_node("hello")
var world = graph.add_node("world")
graph.add_edge(hello, world)
if args.is_empty then
print graph.to_dot
else
graph.to_dot.write_to_file args.first
end
lib/dot/examples/hello.nit:15,1--30,3