Java SimpleDirectedGraph.incomingEdgesOf方法代码示例

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
private void checkChildrenSets(Set<String> oidsToCheck) {
    SimpleDirectedGraph<String,DefaultEdge> tc = (SimpleDirectedGraph) orgGraph.clone();
    TransitiveClosure.INSTANCE.closeSimpleDirectedGraph(tc);
    for (String subroot : oidsToCheck) {
        LOGGER.info("Checking descendants of {}", subroot);
        Set<String> expectedChildren = new HashSet<>();
        for (DefaultEdge edge : tc.incomingEdgesOf(subroot)) {
            expectedChildren.add(tc.getEdgeSource(edge));
        }
        expectedChildren.add(subroot);
        LOGGER.trace("Expected children: {}", expectedChildren);
        Set<String> actualChildren = getActualChildrenOf(subroot);
        LOGGER.trace("Actual children: {}", actualChildren);

        Set<String> expectedMinusActual = new HashSet<>(expectedChildren);
        expectedMinusActual.removeAll(actualChildren);
        if (!expectedMinusActual.isEmpty()) {
            System.out.println("Expected-Actual = " + expectedMinusActual);
        }
        Set<String> actualMinusExpected = new HashSet<>(actualChildren);
        actualMinusExpected.removeAll(expectedChildren);
        if (!actualMinusExpected.isEmpty()) {
            System.out.println("Actual-Expected = " + actualMinusExpected);
        }
        assertEquals("Incorrect children for " + subroot, expectedChildren, actualChildren);
    }
}
 

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
/**
 * Utility function recursively traverses a given digraph to build a set of all descendants names.
 *
 * @param vertex      contains the position of the cursor for traversal of graph.
 * @param graph       contains a reference to simple digraph {@code org.jgrapht.graph.SimpleDirectedGraph}.
 * @param descendants contains the result set of names of all descendants of node.
 * @return value contains the vertex of current position.
 */
private static String getDescendants( Map<String, String> vertex, SimpleDirectedGraph<String, Relationship> graph,
    Set<String> descendants )
{
    String v = vertex.get( VERTEX );
    if ( v == null )
    {
        // vertex is null
        return null;
    }
    else if ( graph == null )
    {
        // graph is null
        return null;
    }
    LOG.debug( "getDescendants [{}]", v);
    Set<Relationship> edges;
    try
    {
        edges = graph.incomingEdgesOf( v );
    }
    catch ( java.lang.IllegalArgumentException iae )
    {
        // vertex is leaf.
        return null;
    }
    for ( Relationship edge : edges )
    {
        vertex.put( VERTEX, edge.getChild() );
        descendants.add( edge.getChild() );
        v = getDescendants( vertex, graph, descendants );
    }
    return v;
}
 

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
/**
 * Utility function returns a set of all children (direct descendant) names.
 *
 * @param vertex contains the position of the cursor for traversal of graph.
 * @param graph  contains a reference to simple digraph {@code org.jgrapht.graph.SimpleDirectedGraph}.
 * @return value contains the vertex of current position.
 */
static Set<String> getChildren( String vertex, SimpleDirectedGraph<String, Relationship> graph )
{
    Set<String> descendants = new HashSet<>();
    if ( graph == null )
    {
        // graph is null
        return null;
    }

    LOG.debug( "getChildren [{}]", vertex );
    Set<Relationship> edges;
    try
    {
        edges = graph.incomingEdgesOf( vertex );
    }
    catch ( java.lang.IllegalArgumentException iae )
    {
        // vertex is leaf.
        return null;
    }
    for ( Relationship edge : edges )
    {
        descendants.add( edge.getChild() );
    }
    return descendants;
}