PS: Follows a working groovy snippet for later reference... just my two cents
import org.jgrapht.*
import org.jgrapht.graph.*
import org.jgrapht.alg.*
import org.jgrapht.traverse.*
import org.jgrapht.experimental.dag.*
@Grab(group='org.jgrapht', module='jgrapht-core', version='0.9.0')
DirectedGraph graph = new DirectedAcyclicGraph(DefaultEdge)
graph.addVertex ('A')
graph.addVertex ('B')
graph.addVertex ('C')
graph.addVertex ('D')
graph.addVertex ('E')
graph.addVertex ('F')
graph.addEdge ('A', 'B')
graph.addEdge ('B', 'C')
graph.addEdge ('B', 'D')
graph.addEdge ('D', 'C')
graph.addEdge ('A', 'E')
graph.addEdge ('E', 'F')
graph.addEdge ('F', 'D')
//println "graph: $graph"
Iterator iterator = new DepthFirstIterator (graph, 'B')
Set vertexSubset = [] as LinkedHashSet
//determine the vertexset for the subgraph
while (iterator.hasNext()) {
vertexSubset << iterator.next()
}
//filter the full graph edgeset to obtain the subgraph one
Set edgeSubset = graph.edgeSet().findAll {edge->
graph.getEdgeSource (edge) in vertexSubset && graph.getEdgeTarget (edge) in vertexSubset
}
//create the subgraph
DirectedSubgraph subgraph = new DirectedSubgraph (graph, vertexSubset, edgeSubset)
//println "subgraph: $subgraph"
Locked
