[Boost-users] Levelization of DAG in Boost graph -- trying again

Subject: [Boost-users] Levelization of DAG in Boost graph -- trying again
From: bhattach (bhattach_at_[hidden])
Date: 2015-10-28 14:29:31

Not sure why my previous attempt to post a new topic didn't succeed -- page
kept showing a note that the post was not accepted by the mailing list.
Trying one more time.

------------------------
Although I've been using graphs for 30+ years, I'm new to Boost Graph
Library. I'd like to do "classical levelization" of a DAG -- as is commonly
used in applications like digital logic simulation, etc -- whereby

   level(v) = max_level(set of predecessors of v) + 1

I used record_distances() with breadth_first_search() and suitably defined
property map, but I suspect that's returning

   level(v) = min_level(set of predecessors of v) + 1

Is there a simple way to use breadth_first_search() to get the level numbers
I want, or do I need to write my own levelization routine?

Thanks in advance for comments/suggestions/pointers.

Debashis Bhattacharya 

--
View this message in context: http://boost.2283326.n4.nabble.com/Levelization-of-DAG-in-Boost-graph-trying-again-tp4681269.html
Sent from the Boost - Users mailing list archive at Nabble.com.