This graph should probably be sub-classed as an ontology, and the connecting and abstract bits should be shifted around.

NOTE: This uses graph_path as the primary engine.

Returns the root nodes.

Boolean on acc.

Gets a term from a string.

TODO: should be able to take string or object.

In: acc. Out: Children term (object) list ref.

TODO: should be able to take string or object.

In: acc, acc. Out: int.

TODO: should be able to take string or object.

Takes term. Gets the term2term links from a term.

Takes term. Gets the term2term links from a term.

With an array ref of terms, will climb to the top of the ontology (with an added 'all' stopper for GO).

This returns an array of three things: *) a link list *) a term (node) *) a hashref of of nodes in terms of in-graph descendants

TODO: should also be able to take array ref of strings...