Java Graph类代码示例

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * Checks whether some tables are still expanded.
 * 
 * @param g the graph
 * @param toCheck set of tables to check
 */
private void checkForExpansion(Graph g, java.util.Collection<Table> toCheck) {
	for (Table t: toCheck) {
		if (!expandedTables.contains(t)) {
			addEdges(g, t, null, new ArrayList<Table>(), true);
			boolean isExpanded = true;
			for (Association a: t.associations) {
				if (!isVisualizable(a)) {
					continue;
				}
				if (a.source != t && !tableNodes.containsKey(a.source) && !toCheck.contains(a.source)) {
					isExpanded = false;
					break;
				}
				if (a.destination != t && !tableNodes.containsKey(a.destination) && !toCheck.contains(a.destination)) {
					isExpanded = false;
					break;
				}
			}
			if (isExpanded) {
				expandedTables.add(t);
			}
		}
	}
}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * Checks whether some tables are still collapsed.
 * 
 * @param g the graph
 * @param toCheck set of tables to check
 */
private void checkForCollapsed(Graph g, java.util.Collection<Table> toCheck) {
	for (Table t: toCheck) {
		if (expandedTables.contains(t)) {
			boolean isExpanded = true;
			for (Association a: t.associations) {
				if (!isVisualizable(a)) {
					continue;
				}
				if (!renderedAssociations.containsKey(a) && !renderedAssociations.containsKey(a.reversalAssociation)) {
					isExpanded = false;
					break;
				}
			}
			if (!isExpanded) {
				expandedTables.remove(t);
			}
		}
	}
}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * Transforms a given OWL Ontology to a graph.
 *
 * @param onto the OWL ontology
 * @param id   the viewManager id
 */
public void transformOWLtoGraph(OWLOntology onto, String id) {
	Graph graph = GraphStorage.getGraph(id);

	if (onto == null || graph == null) {
		return;
	}

	GraphDataModifier mod = GraphStorage.getDataModifier(id);
	Set<OWLClass> OWLClassSet = onto.getClassesInSignature();
	transformClasses(OWLClassSet, onto, mod);
	Set<OWLObjectProperty> OWLObjectPropertiesSet = onto.getObjectPropertiesInSignature();
	transformObjectProperty(OWLObjectPropertiesSet, onto, mod, id);
	Set<OWLDataProperty> OWLDataPropertiesSet = onto.getDataPropertiesInSignature();
	transformDataTypeProperty(OWLDataPropertiesSet, onto, mod, id);
	//	logger.info("# direct imports: " + onto.getDirectImports().toString());
	//	logger.info("# imports: " + onto.getImports().toString());
	//	logger.info("# import declaration: " + onto.getImportsDeclarations().toString());
	transformSubClassesDefinedOutsideOtherClass(OWLClassSet, onto, mod);
}
 

import prefuse.data.Graph; //导入依赖的package包/类
@Override
public void run( Graph graph )
{
    // add the GRAPH to the visualization
    m_vis.add( GRAPH, graph );

    // hide edges
    Predicate edgesPredicate = (Predicate) ExpressionParser.parse( "ingroup('graph.edges') AND [" + USES_EDGES + "]==false", true );
    m_vis.setVisible( GRAPH_EDGES, edgesPredicate, false );

    m_vis.setInteractive( GRAPH_EDGES, null, false );

    // make node interactive
    m_vis.setInteractive( GRAPH_NODES, null, true );

    // add LABELS to the visualization
    Predicate labelP = (Predicate) ExpressionParser.parse( "VISIBLE()" );
    m_vis.addDecorators( LABELS, GRAPH_NODES, labelP, LABEL_SCHEMA );

    run();
}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * Checks if is multi line.
 * 
 * @param g
 *            the g
 * @return the int
 */
private int isMultiLine(Graph g) {
	int multi = -1;
	Object ori = g.getEdge(g.getEdgeCount() - 1).get("source"); // nodo origen
	Object fin = g.getEdge(g.getEdgeCount() - 1).get("target"); // nodo fin

	for (int i = 0; i < g.getEdgeCount() - 1; i++) {
		if (((Integer) ori).equals((Integer) (g.getEdge(i).get("source")))
				&& ((Integer) fin).equals((Integer) (g.getEdge(i).get("target")))) {
			multi = i;
			return multi;
		}
	}

	return multi;
}
 

import prefuse.data.Graph; //导入依赖的package包/类
public void setGraph(Graph g, String label) {
    // update labeling
    DefaultRendererFactory drf = (DefaultRendererFactory)
                                            m_vis.getRendererFactory();
    ((LabelRenderer)drf.getDefaultRenderer()).setTextField(label);
    
    // update graph
    m_vis.removeGroup(graph);
    vg = m_vis.addGraph(graph, g);
    m_vis.setValue(edges, null, VisualItem.INTERACTIVE, Boolean.FALSE);
    /*
    VisualItem f = (VisualItem)vg.getNode(0);
    m_vis.getGroup(Visualization.FOCUS_ITEMS).setTuple(f);
    f.setFixed(false);
	*/
}
 

import prefuse.data.Graph; //导入依赖的package包/类
public void setGraph(Graph g, String label) {
    // update labeling
	/*
    DefaultRendererFactory drf = (DefaultRendererFactory)
                                            m_vis.getRendererFactory();
    ((LabelRenderer)drf.getDefaultRenderer()).setTextField(label);
     */
    // update graph
    m_vis.removeGroup(graph);
    vg = m_vis.addGraph(graph, g);
    m_vis.setValue(edges, null, VisualItem.INTERACTIVE, Boolean.FALSE);
    /*
    VisualItem f = (VisualItem)vg.getNode(0);
    m_vis.getGroup(Visualization.FOCUS_ITEMS).setTuple(f);
    f.setFixed(false);
	*/
}
 

import prefuse.data.Graph; //导入依赖的package包/类
private void initDataGroups() {
	// create sample graph
	// 9 nodes broken up into 3 interconnected cliques
	Graph g = new Graph();
	for ( int i=0; i<3; ++i ) {
		Node n1 = g.addNode();
		Node n2 = g.addNode();
		Node n3 = g.addNode();
	}

	// add visual data groups
	VisualGraph vg = m_vis.addGraph(GRAPH, g);
	m_vis.setInteractive(EDGES, null, false);
	m_vis.setValue(NODES, null, VisualItem.SHAPE,
			new Integer(Constants.SHAPE_ELLIPSE));

	AggregateTable at = m_vis.addAggregates(AGGR);
	at.addColumn(VisualItem.POLYGON, float[].class);
	at.addColumn("id", int.class);

}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * Create a new PolarDonutFDRLayout.
 * @param group the data group to layout. Must resolve to a Graph instance.
 * @param enforceBounds indicates whether or not the layout should require
 * that all node placements stay within the layout bounds.
 * @param runonce indicates if the layout will be run in a run-once or
 * animated fashion. In run-once mode, the layout will run for a set number
 * of iterations when invoked. In animation mode, only one iteration of the
 * layout is computed.
 */
public PolarDonutFDRLayout(double circleRadius, String m_group, String filter,
		boolean enforceBounds, boolean runonce){
	super(m_group);

	this.circleRadius = circleRadius;
	this.filter = filter + " and visible()";// and isnode()";
	this.m_filter = (Predicate)ExpressionParser.parse(this.filter);

	m_nodeGroup = PrefuseLib.getGroupName(m_group, Graph.NODES);
	m_edgeGroup = PrefuseLib.getGroupName(m_group, Graph.EDGES);

	m_enforceBounds = enforceBounds;
	m_runonce = runonce;
	m_fsim = new ForceSimulator();
	m_fsim.addForce(new NBodyForce());
	m_fsim.addForce(new SpringForce());
	m_fsim.addForce(new DragForce());
	
	//getForceSimulator().setSpeedLimit(.3f);//XXX: Tweak
}
 

import prefuse.data.Graph; //导入依赖的package包/类
private void initDataGroups() {
	// create sample graph
	g = new Graph(true);
	for (int i = 0; i < 3; ++i) {
		Node n1 = g.addNode();
		Node n2 = g.addNode();
		Node n3 = g.addNode();
		g.addEdge(n1, n2);
		g.addEdge(n1, n3);
		// g.addEdge(n2, n3);
	}
	g.addEdge(0, 3);
	// g.addEdge(3, 6);
	g.addEdge(6, 0);
	// add labels for nodes and edges
	g.addColumn(VisualItem.LABEL, String.class);
	for (int i = 0; i < 9; i++) {
		g.getNode(i).setString(VisualItem.LABEL, "Node " + i);
	}
}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * @see prefuse.data.io.GraphReader#readGraph(java.io.InputStream)
 */
public Graph readGraph(InputStream is) throws DataIOException {
    try {       
        SAXParserFactory factory   = SAXParserFactory.newInstance();
        SAXParser        saxParser = factory.newSAXParser();
        
        GraphMLHandler   handler   = new GraphMLHandler();
        saxParser.parse(is, handler);
        return handler.getGraph();
    } catch ( Exception e ) {
        if ( e instanceof DataIOException ) {
            throw (DataIOException)e;
        } else {
            throw new DataIOException(e);
        }
    }
}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * Returns a clique of given size. A clique is a graph in which every node
 * is a neighbor of every other node.
 * @param n the number of nodes in the graph
 * @return a clique of size n
 */
public static Graph getClique(int n) {
    Graph g = new Graph();
    g.getNodeTable().addColumns(LABEL_SCHEMA);
    
    Node nodes[] = new Node[n];
    for ( int i = 0; i < n; ++i ) {
        nodes[i] = g.addNode();
        nodes[i].setString(LABEL, String.valueOf(i));
    }
    for ( int i = 0; i < n; ++i ) {
        for ( int j = i; j < n; ++j )
            if ( i != j )
                g.addEdge(nodes[i], nodes[j]);
    }
    return g;
}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
 * Returns a graph structured as an m-by-n grid.
 * @param m the number of rows of the grid
 * @param n the number of columns of the grid
 * @return an m-by-n grid structured graph
 */
public static Graph getGrid(int m, int n) {
    Graph g = new Graph();
    g.getNodeTable().addColumns(LABEL_SCHEMA);
    
    Node[] nodes = new Node[m*n];
    for ( int i = 0; i < m*n; ++i ) {
        nodes[i] = g.addNode();
        nodes[i].setString(LABEL, String.valueOf(i));
        
        if ( i >= n )
            g.addEdge(nodes[i-n], nodes[i]);
        if ( i % n != 0 )
            g.addEdge(nodes[i-1], nodes[i]);
    }
    return g;
}
 

import prefuse.data.Graph; //导入依赖的package包/类
/**
    * @see prefuse.action.Action#run(double)
    */
   public void run(double frac) {
       Graph g = (Graph)m_vis.getGroup(m_group);
       initSchema(g.getNodes());
       
       Arrays.fill(m_depths, 0);
       m_maxDepth = 0;
       
       Point2D a = getLayoutAnchor();
       m_ax = a.getX();
       m_ay = a.getY();
       
       NodeItem root = getLayoutRoot();
       Params rp = getParams(root);

g.getSpanningTree(root);
       
       // do first pass - compute breadth information, collect depth info
       firstWalk(root, 0, 1);
       
       // sum up the depth info
       determineDepths();
       
       // do second pass - assign layout positions
       secondWalk(root, null, -rp.prelim, 0);
   }
 

import prefuse.data.Graph; //导入依赖的package包/类
private void init(Graph g, Rectangle2D b) {
    initSchema(g.getNodes());
    
    temp = b.getWidth() / 10;
    forceConstant = 0.75 * 
        Math.sqrt(b.getHeight()*b.getWidth()/g.getNodeCount());
    
    // initialize node positions
    Iterator nodeIter = g.nodes();
    Random rand = new Random(42); // get a deterministic layout result
    double scaleW = ALPHA*b.getWidth()/2;
    double scaleH = ALPHA*b.getHeight()/2;
    while ( nodeIter.hasNext() ) {
        NodeItem n = (NodeItem)nodeIter.next();
        Params np = getParams(n);
        np.loc[0] = b.getCenterX() + rand.nextDouble()*scaleW;
        np.loc[1] = b.getCenterY() + rand.nextDouble()*scaleH;
    }
}