How do you best traverse a forking polyline graph (a tree)?

As I understand, VEX does not support recursion, and in Python there's no easy way to get connectivity information!

EDIT:
I tried promoting the neighbors to an point attribute array via vex. But now it turns out that python (hou) can't read point attribute arrays?

It is very easy to get the connectivity information in Python. Just use node.inputs().

As far as I recall, reading array attributes from python should just work using the usual methods to read attribute values.

Having said that, I would consider doing it all in VEX. You can put the Attribute Wrangle in Detail mode and then loop to your hearts content. Recursion is not necessary for graph traversals, there are plenty of ways to do things iteratively using array variables as stacks.

thanks guys.

@Enivob: Connectivity in terms of SOP geometry. For example There's no direct way via python to find the connected neighbors of a point, although, as a work around you can store them an point attribute array via VEX first, and read that.

@edward: right, VEX and non-recursion algorithms are probably the best, I'll try out some of these [stackoverflow.com]

smuseus
I'll try out some of these [stackoverflow.com]

Ack, from the best answer on that stack overflow link, do NOT do take_first()/prepend() (in any language). Just use the VEX pop()/push() functions, which do “remove last” and “append to end” respectively.