algorithm - How to find the root of a dependency tree using parent and child information of a node -
algorithm - How to find the root of a dependency tree using parent and child information of a node -
i first provide background info. how info stored:
%pom_family{$gav} = [\%parents, \%children]
before posing question define above variables way utilize them in context:
$gav --> can considered random node in our dependency tree %parents --> hash contains list of nodes $gav depends on %children--> hash contains list of nodes depend on our $gavmy question following:
given have parents , children of chosen node, algorithm appropriate utilize in order analyze dependency dependency , find root $gav ie $gav has no parents.thanks in advance! :-d
note: if question not clear enough, provide feedback , alter question :-)
algorithm tree dependencies root nodes
Comments
Post a Comment