Examples of SimpleGraph

Examples of org.apache.clerezza.rdf.core.impl.SimpleGraph

35
36
37
38
39
40
41
        super(wrappedMGraph);
    }

    @Override
    public Graph getGraph() {
        return new SimpleGraph(this);
    }
View Full Code Here

Examples of org.apache.clerezza.rdf.core.impl.SimpleGraph

57
58
59
60
61
62
63
64
65
66
67
        } catch (NoSuchEntityException e) {
            Graph result;
            if (Graph.class.isAssignableFrom(triples.getClass())) {
                result = (Graph) triples;
            } else {
                result = new SimpleGraph(triples);
            }
            tripleMap.put(name, result);

            return result;
        }
View Full Code Here

Examples of org.jamesii.core.util.graph.SimpleGraph

33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
  @Override
  public ISimpleGraph analyzeModel(IModel model) {

    if (!(model instanceof ICAGrid)) {
      modelGraph = new SimpleGraph(1);
      return modelGraph;
    }

    ICAGrid caModel = (ICAGrid) model;

    int vertexCount = countNodes(caModel);

    modelGraph = new SimpleGraph(vertexCount);

    createEdges(caModel);

    // Setting calculation costs equally
    for (int i = 0; i < vertexCount; i++) {
View Full Code Here

Examples of org.jamesii.core.util.graph.SimpleGraph

23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
  /**
   * Tests the cycle detection.
   */
  public void testCycleDetection() {
    SimpleGraph simpleGraph = new SimpleGraph(5);
    simpleGraph.addEdge(new AnnotatedEdge<Integer, Double, Object>(0, 1));
    simpleGraph.addEdge(new AnnotatedEdge<Integer, Double, Object>(1, 2));
    simpleGraph.addEdge(new AnnotatedEdge<Integer, Double, Object>(2, 3));
    simpleGraph.addEdge(new AnnotatedEdge<Integer, Double, Object>(3, 4));
    List<Integer> cycle = CycleDetection.detectCycle(simpleGraph);
    assertTrue("There is no cycle in the given graph.", cycle.isEmpty());
    simpleGraph.addEdge(new AnnotatedEdge<Integer, Double, Object>(4, 2));
    cycle = CycleDetection.detectCycle(simpleGraph);
    assertTrue(
        "There is a cycle (2,3,4) in the given graph.",
        cycle.size() == 3 && cycle.contains(2) && cycle.contains(3)
            && cycle.contains(4));
View Full Code Here

Examples of org.jamesii.core.util.graph.SimpleGraph

35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
  /**
   * Simple test of Dijkstra algorithm.
   */
  public void testSimpleExample() {
    SimpleGraph graph = createTestGraph();

    Map<Integer, Double> pathLengths = dijkstra.compute(graph, 0);
    addInformation("Calculated result:" + Strings.dispMap(pathLengths));

    assertEquals("There should be a path length for each vertex.",
        graph.getVertexCount(), pathLengths.size());
    for (Integer vertex : graph.getVertices()) {
      assertNotNull(pathLengths.get(vertex));
      assertFalse(Double.isInfinite(vertex));
    }

    // Check true solution:
View Full Code Here

Examples of org.jamesii.core.util.graph.SimpleGraph

62
63
64
65
66
67
68
69
70
71
72
  /**
   * Test unconnected graph. All distances (except to the start node) should be
   * infinite.
   */
  public void testUnconnectedGraph() {
    SimpleGraph graph = new SimpleGraph(NUM_OF_VERTICES_EMPTY_GRAPH);
    Map<Integer, Double> pathLengths = dijkstra.compute(graph, 0);
    for (int i = 1; i < NUM_OF_VERTICES_EMPTY_GRAPH; i++) {
      assertTrue(Double.isInfinite(pathLengths.get(i)));
    }
  }
View Full Code Here

Examples of org.jamesii.core.util.graph.SimpleGraph

76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
   * href="http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">Wikipedia</a>.
   *
   * @return the graph
   */
  private SimpleGraph createTestGraph() {
    SimpleGraph testGraph = new SimpleGraph(6);

    testGraph.addEdge(new AnnotatedEdge<>(0, 1, 7.));
    testGraph.addEdge(new AnnotatedEdge<>(0, 2, 9.));
    testGraph.addEdge(new AnnotatedEdge<>(0, 5, 14.));

    testGraph.addEdge(new AnnotatedEdge<>(1, 2, 10.));
    testGraph.addEdge(new AnnotatedEdge<>(1, 3, 15.));

    testGraph.addEdge(new AnnotatedEdge<>(2, 3, 11.));
    testGraph.addEdge(new AnnotatedEdge<>(2, 5, 2.));

    testGraph.addEdge(new AnnotatedEdge<>(3, 4, 6.));

    testGraph.addEdge(new AnnotatedEdge<>(4, 5, 9.));
    return testGraph;
  }
View Full Code Here

Examples of org.jamesii.core.util.graph.SimpleGraph

81
82
83
84
85
86
87
   *          the number of nodes
   *
   * @return the random simple graph
   */
  public ISimpleGraph getRandomSimpleGraph(int numberOfNodes) {
    return getRandomSimpleGraph(new SimpleGraph(numberOfNodes));
  }
View Full Code Here

Examples of org.wymiwyg.rdf.graphs.impl.SimpleGraph

205
206
207
208
209
210
211
212
213
214
215
          try {
            Subject.doAsPrivileged(null, new PrivilegedExceptionAction() {
              public Object run() throws Exception {
                Source source = new SourceImpl("http://example.org/graph-source");
                try {
                  store.assertGraph(source, new FCAGraphImpl(new SimpleGraph()));
                } catch (AccessControlException ex) {
                  exceptionCatched[0] = true;
                }
                return null;
              }
View Full Code Here

Examples of org.wymiwyg.rdf.graphs.impl.SimpleGraph

794
795
796
797
798
799
800
801
802
803
804
805
806
807
        }
      } else {
        relevantTriples.add(triple);
      }
    }
    SimpleGraph result = new SimpleGraph();
    for (Triple triple : relevantTriples) {
      result.add(new TripleImpl(replaceIfPossible(triple.getSubject(),
          map), triple.getPredicate(), replaceIfPossible(triple
          .getObject(), map)));
    }
    result.markFinalized();
    return result;
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.