Re: [jgrapht-users] converting directed graph to directed acyclic graph

[Haluk D. <hlk...@gm...>]

Say I have a directed graph. I actually want to convert it to Bayesian
Network which requires DAG. Even though, removing edges breaks the
dependency relation of nodes, it is OK for this phase of my analysis. I'll
do the same with Spirtes method later on.

Adding, removing, reorienting edges are fine. But I can not remove vertices.

Thanks.


On Sat, Feb 15, 2014 at 3:45 AM, H.N. de Ridder
<hnr...@gr...>wrote:

> On Fri, Feb 14, 2014 at 03:43:24PM -0600, Haluk Dogan wrote:
>
> > 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 jGrapht.
>
> Can you describe more precisely what you mean by 'convert' and for which
> purpose? Add edges? Remove edges? Reorient them? Remove vertices?
> Any minimality constraints?
>
> Regards,
>    Ernst
>
> --
> Information System on Graph Classes and their Inclusions (ISGCI)
> http://www.graphclasses.org
>
>
> ------------------------------------------------------------------------------
> 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
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>



-- 
HD