Re: [jgrapht-users] Connectivity of Directed Graphs

[<hnr...@gr...>]

Hi Ulrich,

can't you use the BreadthFirstIterator or the DepthFirstIterator? I'd think either should do what you want.

Regards,
   Ernst

-- 
Information System on Graph Classes and their Inclusions (ISGCI) http://www.graphclasses.org

----- Reply message -----
From: "Wielant, Ulrich" <U.W...@ge...>
To: "'jgr...@li...'" <jgr...@li...>
Subject: [jgrapht-users] Connectivity of Directed Graphs
Date: Tue, Aug 30, 2011 11:11


Hello everyone,

first of all a big congratulation for maintaining this great framework. I am using it since 4 years and I am still happy with it :-)

Now my question:

I am using a DirectedGraph and I want to get a list of vertices that are reachable from a given vertex with respect to the directions. The ConnectivityInspector does not care about the edge directions whereas the StrongConnectivityInspector only uses strong (so double directed) connections.
Any hints how I can achieve the list of reachable nodes?

Example:

  A <--> B <-- C

reachable(A) => [B]
reachable(B) => [A]
reachable(C) => [A,B]

Thanks!
Uli

www.gematronik.com
www.selex-si.de

Selex Systems Integration GmbH
Sitz der Gesellschaft / Registered Office: Neuss
Registergericht / Register Court: Neuss HR B 1242
Gesch?ftsf?hrer / Managing Director: Ulrich Nellen

------------------------------------------------------------------------------
Special Offer -- Download ArcSight Logger for FREE!
Finally, a world-class log management solution at an even better 
price-free! And you'll get a free "Love Thy Logs" t-shirt when you
download Logger. Secure your free ArcSight Logger TODAY!
http://p.sf.net/sfu/arcsisghtdev2dev
_______________________________________________
jgrapht-users mailing list
jgr...@li...
https://lists.sourceforge.net/lists/listinfo/jgrapht-users