Package prefuse.data

Examples of prefuse.data.Graph

103
104
105
106
107
108
109
110
111
112
113
114
      Data[] resultInMemory = comparePhaseResultResult.getResult();
   

      // graph comparison phase

      Graph resultGraph = (Graph) originalInMemory[0].getData();
      Graph origGraph = (Graph) resultInMemory[0].getData();

      NewGraphComparer comparer = testData.getComparer();
      ComparisonResult graphComparisonPhaseResult = comparer.compare(
          origGraph, resultGraph);
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
  }
 
  private static void runRealTests(GraphComparer comparer,
      boolean idsPreserved) {
    //directedness test
    Graph directedness1 = loadGraph("directedness1.xml");
    Graph directedness2 = loadGraph("directedness2.xml");
   
    ComparisonResult result1 = comparer.compare(directedness1,
        directedness2, idsPreserved);
   
    System.out.println("Directedness Test (should fail) ... " + result1);
   
    //nodecount test
    Graph nodeCount1 = loadGraph("nodecount1.xml");
    Graph nodeCount2 = loadGraph("nodecount2.xml");
   
    ComparisonResult result2 = comparer.compare(nodeCount1, nodeCount2,
        idsPreserved);
   
    System.out.println("Node Count Test (should fail) ... " + result2);
   
    //edgecount test
    Graph edgeCount1 = loadGraph("edgecount1.xml");
    Graph edgeCount2 = loadGraph("edgecount2.xml");
   
    ComparisonResult result3 = comparer.compare(edgeCount1, edgeCount2,
        idsPreserved);
   
    System.out.println("Edge Count Test (should fail) ... " + result3); 

 
    //neighbor test 1
    Graph neighbor1 = loadGraph("neighbor1.xml");
    Graph neighbor2 = loadGraph("neighbor2.xml");
   
    ComparisonResult result4 = comparer.compare(neighbor1, neighbor2,
        idsPreserved);
   
    System.out.println("Neighbor Test 1 (should fail, but will be missed if idsNotPreserved) ..." + result4);
   
    //neighbor test 2
    Graph neighbor3 = loadGraph("neighbor3.xml");
    Graph neighbor4 = loadGraph("neighbor4.xml");
   
    ComparisonResult result5 = comparer.compare(neighbor3, neighbor4,
        idsPreserved);
   
    System.out.println("Neighbor Test 2 (should pass) ..." + result5);
   
    //neighbor test 3
    Graph neighbor5 = loadGraph("neighbor5.xml");
    Graph neighbor6 = loadGraph("neighbor6.xml");
   
    ComparisonResult result6 = comparer.compare(neighbor5, neighbor6,
        idsPreserved);
   
    System.out.println("Neighbor Test 3 (should pass) ..." + result6);
   
    //edgeFrequency test 1
    Graph frequency1 = loadGraph("edgefrequency1.xml");
    Graph frequency2 = loadGraph("edgefrequency2.xml");
   
    ComparisonResult result7 = comparer.compare(frequency1, frequency2,
        idsPreserved);
   
    System.out.println("Degree frequency test 1 (should fail, but won't " +
        "on idsNotPreserved)" + result7);
   
    //edgeFrequency test2
   
    Graph frequency3 = loadGraph("edgefrequency3.xml");
    Graph frequency4 = loadGraph("edgefrequency4.xml");
   
    ComparisonResult result8 = comparer.compare(frequency3, frequency4,
        idsPreserved);
   
    System.out.println("Degree frequency test 2 (Fail if IdsPreserved) " +
        result8);
   
    //nodeAttributes test 1
    Graph nodeAttr1 = loadGraph("nodeattributes1.xml");
    Graph nodeAttr2 = loadGraph("nodeattributes2.xml");
   
    ComparisonResult result9 = comparer.compare(nodeAttr1, nodeAttr2,
        idsPreserved);
   
    System.out.println("Node Attributes Test 1 (should fail) ... " +
        result9);
   
    //nodeAttributes test 2
    Graph nodeAttr3 = loadGraph("nodeattributes3.xml");
    Graph nodeAttr4 = loadGraph("nodeattributes4.xml");
   
    ComparisonResult result10 = comparer.compare(nodeAttr3, nodeAttr4,
        idsPreserved);
   
    System.out.println("Node Attributes Test 2 (should fail but may " +
        "pass on ids not preserved) " + result10);
   
    //edgeAttributes
    Graph edgeAttr1 = loadGraph("edgeattributes1.xml");
    Graph edgeAttr2 = loadGraph("edgeattributes2.xml");
   
    ComparisonResult result11 = comparer.compare(edgeAttr1, edgeAttr2,
        idsPreserved);
   
    System.out.println("Edge Attributes Test (should fail) ... " +
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
    Schema edgeTableSchema = new Schema();
    edgeTableSchema.addColumn(Graph.DEFAULT_SOURCE_KEY, Integer.class);
    edgeTableSchema.addColumn(Graph.DEFAULT_TARGET_KEY, Integer.class);
   
    //test1
    Graph emptyGraph1 = new Graph();
    Graph emptyGraph2 = new Graph();
   
    ComparisonResult result1 = comparer.compare(emptyGraph1,
        emptyGraph2, false); 
    System.out.println("Empty undirected graph test ... " + result1);
   
    //test2
    Graph directedGraph1 = new Graph(idsPreserved);
    Graph directedGraph2 = new Graph(idsPreserved);
   
    ComparisonResult result2 = comparer.compare(directedGraph1,
        directedGraph2, true);   
    System.out.println("Empty directed graph test ... " + result2);
   
    //test3
    Table nodeTable1 = new Table();
    nodeTable1.addRows(10);
   
    Table nodeTable2 = new Table();
    nodeTable2.addRows(10);
   
    Graph noEdgeGraph1 = new Graph(nodeTable1, idsPreserved);
    Graph noEdgeGraph2 = new Graph(nodeTable2, idsPreserved);
   
    ComparisonResult result3 = comparer.compare(noEdgeGraph1,
        noEdgeGraph2, false);
    System.out.println("No edge graph test ... " + result3);
   
    //test4 (should fail)
    Table nodeTable3 = new Table();
    nodeTable3.addRows(11);
   
    Graph noEdgeGraph3 = new Graph(nodeTable3, idsPreserved);
   
    ComparisonResult result4 = comparer.compare(noEdgeGraph1,
        noEdgeGraph3, false);
    System.out.println("No edge graph test 2 (should fail) ... " + result4);
  }
View Full Code Here
199
200
201
202
203
204
205
206
207
208
209
  }
 
  private static Graph loadGraph(String directoryPath, String fileName) {
    File fileHandler = new File(directoryPath + fileName);
    try {
    Graph graph= (new GraphMLReader()).readGraph(new FileInputStream(fileHandler));
    return graph;
    } catch (Exception e) {
      System.err.println(e);
      System.exit(1);
      return null; //makes Eclipse happy
View Full Code Here
58
59
60
61
62
63
64
65
66
    private Graph initializeGraph() {
        return getGraph(getSchema());
    }

    private Graph getGraph(final Schema schema) {
        graph = new Graph(true);
        graph.addColumns(schema);
        return graph;
    }
View Full Code Here
490
491
492
493
494
495
496
497
498
499
500
        {
            ResultXML xml = new ResultXML();
            boolean itSaved = xml.openFile(file);
            if (itSaved)
            {
                Graph graph = xml.getGraph();
                thisSession = new PaperScopeSession(graph, this);
                this.Graph_View_Frame.setContentPane(thisSession.getRadialGraph().getGraphDisplayPanel());
                this.Main_Tab_Pane.setSelectedIndex(1);
            }
            else
View Full Code Here
36
37
38
39
40
41
42
      focus_indices = new Vector();
     
      nodes = generateNodesTable();
      edges = generateEdgesTable();
     
      thisGraph = new Graph(nodes, edges, true, "DEFAULT_NODE_KEY", "source", "target");
    }
View Full Code Here
53
54
55
56
57
58
59
      nodes = generateSecondNodesTable();
      //==== Generate the table of new edges
      edges = generateSecondEdgesTable(newFocus, dupeNodes);
     
      //==== create the graph
      thisGraph = new Graph(nodes, edges, true, "DEFAULT_NODE_KEY", "source", "target");
    }   
View Full Code Here
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
        public void run(double frac) {
           
            TupleSet focus = m_vis.getGroup(Visualization.FOCUS_ITEMS);
            if ( focus==null || focus.getTupleCount() == 0 ) return;
           
            Graph g = (Graph)m_vis.getGroup(m_group);
            Node f = null;
            Iterator tuples = focus.tuples();
            while (tuples.hasNext() && !g.containsTuple(f=(Node)tuples.next()))
            {
                f = null;
            }
            if ( f == null ) return;
            g.getSpanningTree(f);
        }
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
        } );
    }

    public void initQi4J( ApplicationDetailDescriptor descriptor )
    {
        Graph graph = GraphBuilder.buildGraph( descriptor );
        Dimension size = getSize();
        treeDisplay.setSize( size.width, size.height );
        treeDisplay.run( graph );

        graph = GraphBuilder.buildGraph( descriptor );
View Full Code Here
TOP

Related Classes of prefuse.data.Graph

  • org.cishell.testing.convertertester.core.tester.graphcomparison.GraphComparerTester
  • org.cishell.testing.convertertester.core.tester2.DefaultTestRunner
  • org.picocontainer.gems.monitors.prefuse.PrefuseDependencyGraph
  • org.qi4j.envisage.graph.GraphBuilder
  • org.qi4j.envisage.graph.GraphPane
  • org.rioproject.tools.ui.GraphView
  • org.rioproject.tools.ui.GraphView$TreeRootAction
  • paperscope.GraphAdapter
  • paperscope.PaperScopeUI
  • paperscope.RadialGraph$TreeRootAction
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.