Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Tree::DAG_Node

by Anonymous Monk
on Sep 02, 2003 at 15:58 UTC ( #288350=note: print w/ replies, xml ) Need Help??


in reply to Tree::DAG_Node

The DAG comes from Directed Acyclic Graph. All the arcs have direction (you can only travel from parent to child, for instance), and the entire graph has no cycles (it isn't possible to travel from a node back to itself without having to retrace the outgoing path). All DAGs can be viewed as trees (or forests, depending on how many connected components you have).


Comment on Re: Tree::DAG_Node

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://288350]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (16)
As of 2014-11-20 21:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (102 votes), past polls