how to find if two vertices are connected with Jung Framework?
Question
I want to know how to check if two vertices are connected in a graph using Jung Framework. Thanks.
1 answers
solution1
0 2012-08-30 06:30:11
If the graph is undirected (you haven't specified) or if you don't care about edge direction, use WeakComponentClusterer to split the graph into its (weakly) connected components, and then check to see if the vertices are in the same component. (BicomponentClusterer is not correct for this case if I understood your question correctly.)
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Java, Jung Framework : How to Edit and Set Vertices locations
How can I group Vertices in jung?
how to use JUNG to color & shape vertices and edges
How to plot vertices using GIS coordinates in JUNG
determine if two vertices are connected jGraphX
setToolTip in JUNG for several vertices
Create “different” vertices with JUNG
How can i define the attributes of edges or vertices by using Jung?
Jung graph library: how to search vertices based on vertex property?
Static order of JUNG vertices, binary trees in JUNG
Related Tags