comment on

I need to generate a node list for some network devices I manage and I need it to be in a hierarchical structure when I am done.

I have the following list that is generated where the fist item it the child and the second item is the parent:

b:a
c:a
d:b
e:c
f:c
[download]

And it needs to look like this when I am done:

   +-b--d
a -+
   +   +-e
   +-c-+
       +-f
[download]

I can parse out my input and basically generate the first list in an array or hash. But, what I am not sure of is how to generate the final data structure as I need to loop through the original list and come up with the hierarchy relationships. I have no idea how to store this either.

Any help with this would be appreciated.

2006-03-22 Retitled by planetscape, as per Monastery guidelines
Original title: 'a complex data structure'

In reply to how to construct tree from parent pointer list by bfdi533

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Pathologically Eclectic Rubbish Lister
	PerlMonks