Re: [jgrapht-users] On extracting a directedsubgraph containing only elements reachable from a given vertex

[Davide C. <dav...@gm...>]

Thankyou for the quick hint... but It seems that
org.jgrapht.alg.ConnectivityInspector#pathExists
ignores edges direction (as  it is based on
org.jgrapht.alg.ConnectivityInspector#connectedSetOf)
Is there any way to determine the set of paths reachable from a given
vertex of a directed graph? This way I could use the results to create a
DirectedSubGraph

2014-11-01 1:04 GMT+01:00 Szabolcs Besenyei <bes...@gm...>:

>
>
> 2014-10-31 18:23 GMT+01:00 Davide Cavestro <dav...@gm...>:
> > I'm trying to figure out a way to extract from a DirectedGraph instance a
> > DirectedSubgraph containing only the subset of vertex/edges reachable
> from a
> > given vertex (of the original graph).
> > Any help appreciated.
>
> ​Ta​
> ke a look at org.jgrapht.alg.ConnectivityInspector#pathExists.
>
> --
> Regards,
>
> Szabolcs
>
>
> ------------------------------------------------------------------------------
>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>