Sorry, I had pasted it in the client. it is attached now. Thanks! Birch On Nov 19, 2012, at 5:03 PM, Jeremiah Willcock <jewillco@osl.iu.edu> wrote:
(off list)
I don't see your attachment on there.
-- Jeremiah Willcock
On Mon, 19 Nov 2012, J Birch wrote:
This isn't a Boost Graph problem per se, just a graph algorithm question. Let's say I have the following graph:
I want to represent this graph in a certain way. In the small legend box above, there are 2 versions of a correct answer. I want to print out each vertex followed by it's immediate adjacent vertex. If it has more than one, then each path from that point should be wrapped in a '()'. Currently, I am using the Ruby RGL package and have tried both a directed and an undirected graph using a depth first search traversal, and have yet to hit on an algorithm that takes every edge case.
Anyone out there have some pointers on how to do this?
Thanks! Birch
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost