Examples of org.gephi.graph.api.GraphView

org.gephi.graph.api.GraphView
Graph view define a subgraph, i.e. a subset of the original graph. GraphModel has at least a single view, called the main view, which contains 100% of the graph. Other views can be defined by users to define subgraphs with a reduced number of nodes and edges. This is typically used by filters, which returns filtered graphs.
GraphModel also contains the visible view, which is the main view by default but can be set to configure the view that is visualized.
What exactly contains the view? The complete hierarchy of nodes, the edges and meta-edges. Each view has separate hierarchy, therefore grouping and meta-edges are independent.
Note that nodes' id is unique, and is not touched by views.
Main or Visible View?
When you need to interact with the graph structure, you have the choice between working on the complete graph, i.e. the main view, or the visible view. In most cases, it's preferable to use the visible view because your action will use the graph currently visualized, which has been potentially filtered by users on purpose.
To get the graph in the visible view, see {@link GraphModel#getGraphVisible()}.
Set the Visible View
This is the typical workflow for filtering a graph and display the results, as done by FiltersAPI.
- Create a new view, which duplicates the main view, with all nodes and edges in it.
- Remove nodes and edges in the view.
- Set the view as the curently visible view.
To set a view as the currently visible view, see {@link GraphModel#setVisibleView(org.gephi.graph.api.GraphView)}. @author Mathieu Bastian

    public void testDelete() {
        Node node1 = nodeMap.get("Node 1");
        Node node2 = nodeMap.get("Node 2");
        Edge edge21 = edgeMap.get("2-1");


        GraphView newView = dhnsGlobal.newView();
        HierarchicalGraph viewGraph = dhnsGlobal.getHierarchicalGraph(newView);


        assertNotNull(node1.getNodeData().getNode(newView.getViewId()));
        assertNotNull(dhnsGlobal.getGraphStructure().getNodeFromDictionnary(node1.getId(), newView.getViewId()));
        assertNotNull(dhnsGlobal.getGraphStructure().getNodeFromDictionnary(node1.getId(), graphGlobal.getView().getViewId()));
        assertNotNull(dhnsGlobal.getGraphStructure().getEdgeFromDictionnary(edge21.getId()));


        graphGlobal.removeNode(node1);


        assertNull(node1.getNodeData().getNode(graphGlobal.getView().getViewId()));
        assertNull(node1.getNodeData().getNode(newView.getViewId()));


        assertEquals(Boolean.FALSE, graphGlobal.contains(node1));
        assertEquals(Boolean.FALSE, viewGraph.contains(node1));
        assertEquals(Boolean.FALSE, graphGlobal.contains(edge21));
        assertEquals(Boolean.FALSE, viewGraph.contains(edge21));

View Full Code Here

            if (graphs.length > 1) {
                throw new IllegalArgumentException("Not Filter accepts a single graph in parameter");
            }


            HierarchicalGraph hgraph = (HierarchicalGraph) graphs[0];
            GraphView hgraphView = hgraph.getView();
            HierarchicalGraph mainHGraph = hgraph.getView().getGraphModel().getHierarchicalGraph();
            for (Edge e : mainHGraph.getEdges().toArray()) {
                Node source = e.getSource().getNodeData().getNode(hgraphView.getViewId());
                Node target = e.getTarget().getNodeData().getNode(hgraphView.getViewId());
                if (source != null && target != null) {
                    Edge edgeInGraph = hgraph.getEdge(source, target);
                    if (edgeInGraph == null) {
                        //The edge is not in graph
                        hgraph.addEdge(e);

View Full Code Here

        Node n1 = factory.newNode("n1");
        Node n2 = factory.newNode("n2");
        rootGraph.addNode(n1);
        rootGraph.addNode(n2);


        GraphView newView = graphModel.newView();
        Graph graphNewView = graphModel.getGraph(newView);
        Node n1c = graphNewView.getNode("n1");
        assertNotSame(n1, n1c);
        assertSame(n1.getNodeData(), n1c.getNodeData());
        assertEquals(((AbstractNode) n1c).getViewId(), newView.getViewId());
        assertSame(n1c, graphNewView.getNode(n1.getId()));


        graphNewView.removeNode(n1c);
        assertNull(graphNewView.getNode("n1"));
        assertNotNull(rootGraph.getNode("n1"));

View Full Code Here

        rootGraph.addNode(n1);
        rootGraph.addNode(n2);
        Edge e1 = factory.newEdge("e1", n1, n2, 1f, false);
        rootGraph.addEdge(e1);


        GraphView newView = graphModel.newView();
        Graph graphNewView = graphModel.getGraph(newView);
        assertNotNull(graphNewView.getEdge(e1.getId()));
        assertNotNull(graphNewView.getEdge(e1.getEdgeData().getId()));
        assertSame(e1, graphNewView.getEdge(e1.getId()));

View Full Code Here

        public Graph filter(Graph[] graphs) {
            if (graphs.length > 1) {
                throw new IllegalArgumentException("Not Filter accepts a single graph in parameter");
            }
            HierarchicalGraph hgraph = (HierarchicalGraph) graphs[0];
            GraphView hgraphView = hgraph.getView();
            HierarchicalGraph mainHGraph = hgraph.getView().getGraphModel().getHierarchicalGraph();
            for (Node n : mainHGraph.getNodes().toArray()) {
                if (n.getNodeData().getNode(hgraphView.getViewId()) == null) {
                    //The node n is not in graph
                    hgraph.addNode(n);
                } else {
                    //The node n is in graph
                    hgraph.removeNode(n);
                }
            }


            for (Node n : hgraph.getNodes().toArray()) {
                Node mainNode = n.getNodeData().getNode(mainHGraph.getView().getViewId());
                Edge[] edges = mainHGraph.getEdgesAndMetaEdges(mainNode).toArray();
                for (Edge e : edges) {
                    if (e.getSource().getNodeData().getNode(hgraphView.getViewId()) != null
                            && e.getTarget().getNodeData().getNode(hgraphView.getViewId()) != null) {
                        hgraph.addEdge(e);
                    }
                }
            }

View Full Code Here

        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getModel();
        Graph result = processor.process((AbstractQueryImpl) query, graphModel);
//        System.out.println("#Nodes: " + result.getNodeCount());
//        System.out.println("#Edges: " + result.getEdgeCount());
        if (running) {
            GraphView view = result.getView();
            graphModel.setVisibleView(view);
            if (model.getCurrentResult() != null) {
                graphModel.destroyView(model.getCurrentResult());
            }
            model.setCurrentResult(view);

View Full Code Here

            VisualizationController visController = Lookup.getDefault().lookup(VisualizationController.class);
            if (visController != null) {
                visController.selectNodes(result.getNodes().toArray());
                visController.selectEdges(result.getEdges().toArray());
            }
            GraphView view = result.getView();
            model.setCurrentResult(view);
        } else {
            //destroy view
            graphModel.destroyView(result.getView());
        }

View Full Code Here

    }


    public void exportToColumn(String title, Query query) {
        HierarchicalGraph result;
        if (model.getCurrentQuery() == query) {
            GraphView view = model.getCurrentResult();
            if (view == null) {
                return;
            }
            result = model.getGraphModel().getHierarchicalGraph(view);
        } else {

View Full Code Here

    }


    public void exportToNewWorkspace(Query query) {
        HierarchicalGraph result;
        if (model.getCurrentQuery() == query) {
            GraphView view = model.getCurrentResult();
            if (view == null) {
                return;
            }
            result = model.getGraphModel().getHierarchicalGraph(view);
        } else {

View Full Code Here

    }


    public void exportToLabelVisible(Query query) {
        HierarchicalGraph result;
        if (model.getCurrentQuery() == query) {
            GraphView view = model.getCurrentResult();
            if (view == null) {
                return;
            }
            result = model.getGraphModel().getHierarchicalGraph(view);
        } else {

View Full Code Here

0 1 2

TOP

Related Classes of org.gephi.graph.api.GraphView

org.gephi.filters.FilterControllerImpl

org.gephi.filters.FilterProcessor

org.gephi.filters.FilterThread

org.gephi.filters.plugin.graph.NeighborsBuilder$NeighborsFilter

org.gephi.filters.plugin.operator.MASKBuilderEdge$MaskEdgeOperator

org.gephi.filters.plugin.operator.NOTBuilderEdge$NotOperatorEdge

org.gephi.filters.plugin.operator.NOTBuilderNode$NOTOperatorNode

org.gephi.graph.dhns.core.DhnsTestId

org.gephi.graph.dhns.filter.DhnsTestFiltering

org.gephi.statistics.StatisticsControllerImpl

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of org.gephi.graph.api.GraphView

Main or Visible View?

Set the Visible View

Related Classes of org.gephi.graph.api.GraphView