Re: [Jung-support] converting directed graph to directed acyclic graph

[Joshua O'M. <jos...@gm...>]

JUNG does not have a built-in mechanism to remove cycles from a graph.  You
can implement whatever algorithm that you like using the JUNG libraries, of
course.

Good luck!

Joshua O'Madadhain


On Fri, Feb 14, 2014 at 1:39 PM, Haluk Dogan <hlk...@gm...> wrote:

> Hi,
>
> I want to convert my directed graph to directed acyclic graph. I know
> Feedback Vertex Set algorithm can do this. However, I couldn't see its
> method in Jung.
>
> Is there any other way to do this by using Jung?
>
> Thanks.
>
> --
> HD
>
>
> ------------------------------------------------------------------------------
> Android apps run on BlackBerry 10
> Introducing the new BlackBerry 10.2.1 Runtime for Android apps.
> Now with support for Jelly Bean, Bluetooth, Mapview and more.
> Get your Android app in front of a whole new audience.  Start now.
>
> http://pubads.g.doubleclick.net/gampad/clk?id=124407151&iu=/4140/ostg.clktrk
> _______________________________________________
> Jung-support mailing list
> Jun...@li...
> https://lists.sourceforge.net/lists/listinfo/jung-support
>
>


-- 
jos...@gm.........sites.google.com/site/joshuaomadadhain/
   Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall
It's that moment of dawning comprehension that I live for.  -- Bill
Watterson
 My opinions are too rational and insightful to be those of any
organization.