Paul Martz wrote: >> Cory Riddell wrote: >>> I want to create a graph where some nodes have more than one parent, >>> but >>> every parent node doesn't necessary have a non-backtracking path >>> back to >>> the root node. Does this make sense? How about some bad ascii art: >>> >>> A >>> | >>> B C >>> | / >>> D >>> >>> "A" has been designated as the root but there is a node "C" that >>> isn't a >>> child of that root. Is this possible? > > Unless you've hidden some deeper question within your question, the > answer is to simply do this: > A->addChild( B ); > B->addChild( D ); > C->addChild( D );
Well, I haven't actually tried it yet, but Gordon says none of the traversal routines will ever see "C". This makes sense to me. Is it wrong? Cory _______________________________________________ osg-users mailing list [email protected] http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org
