Java SimpleDirectedGraph.addEdge方法代码示例

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
/**
 * This method converts from physical ldap entity format, {@link Hier} to logical {@code org.jgrapht.graph.SimpleDirectedGraph}.
 *
 * @param hier contains parent-child relationship in preparation to storing in ldap {@code ftRels} attribute of {@code ftHier} object class.
 * @return {@code org.jgrapht.graph.SimpleDirectedGraph} containing the vertices of {@code String}, and edges, as {@link Relationship}s that correspond to relational data.
 */
private static SimpleDirectedGraph<String, Relationship> toGraph( Hier hier )
{
    LOG.debug( "toGraph" );
    SimpleDirectedGraph<String, Relationship> graph =
        new SimpleDirectedGraph<>( Relationship.class );
    List<Relationship> edges = hier.getRelationships();
    if ( edges != null && edges.size() > 0 )
    {
        for ( Relationship edge : edges )
        {
            String child = edge.getChild();
            String parent = edge.getParent();

            try
            {
                graph.addVertex( child );
                graph.addVertex( parent );
                graph.addEdge( child, parent, edge );
            }
            catch (java.lang.IllegalArgumentException e)
            {
                String error = "toGraph child: " + child + " parent: " + parent + " caught IllegalArgumentException=" + e;
                LOG.error( error );
            }

            LOG.debug( "toGraph child={}, parent={}", child, parent );
        }
    }
    return graph;
}
 

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
public List<String> sort(List<Class<?>> classes) throws OrderSortCycleException {
    List<String> result = new ArrayList<>();
    SimpleDirectedGraph<String, DefaultEdge> graph = new SimpleDirectedGraph<>(DefaultEdge.class);
    
    for (OrderConstraint orderConstraint : getConstraints(classes)) {
        graph.addVertex(orderConstraint.getFirst());
        graph.addVertex(orderConstraint.getSecond());
        
        graph.addEdge(orderConstraint.getFirst(), orderConstraint.getSecond());
    }
    
    CycleDetector<String, DefaultEdge> cycleDetector = new CycleDetector<>(graph);
    if(!cycleDetector.detectCycles()) {
                    for (TopologicalOrderIterator<String, DefaultEdge> iterator = new TopologicalOrderIterator<>(graph); iterator.hasNext();) {
            result.add(iterator.next());
        }
    } else {
        String cycles = Joiner.on(", ").join(cycleDetector.findCycles());
        
        throw new OrderSortCycleException("The given order constraints contain (at least one) cycle. Cycles can only "
                + "be caused by static references because we have single inherintance only in Java (involved classes: '" + cycles + "').");
    }

    return result;
}
 

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
/**
 * This method is synchronized and adds an edge and its associated vertices to simple directed graph stored in static memory of this process.
 *
 * @param graph synchronized parameter contains a reference to simple digraph {@code org.jgrapht.graph.SimpleDirectedGraph}.
 * @param relation contains parent-child relationship targeted for addition.
 * @return {@code org.jgrapht.graph.SimpleDirectedGraph} containing the vertices of {@code String}, and edges, as {@link Relationship}s that correspond to relational data.
 */
private static void addEdge( SimpleDirectedGraph<String, Relationship> graph, Relationship relation )
{
    LOG.debug( "addEdge" );
    synchronized ( graph )
    {
        graph.addVertex( relation.getChild().toUpperCase() );
        graph.addVertex( relation.getParent().toUpperCase() );
        graph.addEdge( relation.getChild().toUpperCase(), relation.getParent().toUpperCase(), relation );
    }
}
 

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
/**
 * @param hier
 * @return
 * @throws org.apache.directory.fortress.core.SecurityException
 *
 */
public static SimpleDirectedGraph<String, Relationship> toGraphNotUsed(Hier hier)
{
    LOG.info("toGraphX");
    SimpleDirectedGraph<String, Relationship> graph =
        new SimpleDirectedGraph<>(Relationship.class);
    //List<String> roles = hier.getRoles();
    //if (roles != null)
    //{
    //    for (String role : roles)
    //    {
    //        graph.addVertex(role);
    //    }
    //}
    List<Relationship> edges = hier.getRelationships();
    if (edges != null && edges.size() > 0)
    {
        for (Relationship edge : edges)
        {

            String child = edge.getChild();
            String parent = edge.getParent();
            graph.addVertex(child);
            graph.addVertex(parent);
            graph.addEdge(child, parent, edge);
            if (LOG.isDebugEnabled())
                LOG.debug("toGraphX child=" + child + " parent=" + parent);
        }
    }
    return graph;
}
 

import org.jgrapht.graph.SimpleDirectedGraph; //导入方法依赖的package包/类
/**
 * Build a graph containing all module dependencies
 */
private SimpleDirectedGraph<ModuleModel, Edge> buildModuleDependencyGraph() {
	SimpleDirectedGraph<ModuleModel, Edge> g = buildExportGraph();

	// add import dependencies
	for (ModuleModel module : modules.values()) {
		for (ModuleModel imported : module.importedModules) {
			g.addEdge(module, imported);
		}
	}
	return g;
}