Package lt.refactory.primsAlgo.graph

Examples of lt.refactory.primsAlgo.graph.Edge

61
62
63
64
65
66
67
68
69
      e.printStackTrace();
    }
   
    assertTrue(PrimsAlgorithm.hasCycle(graph));
   
    graph.removeEdge(new Edge(nodeA,nodeB));
   
    assertFalse(PrimsAlgorithm.hasCycle(graph));   
  }
View Full Code Here
10
11
12
13
14
15
16
import lt.refactory.primsAlgo.service.algorithm.SteinersAlgorithm;

public class SteinerObjectsProvider {
 
  public Edge getEdge(int firstX, int firstY, int secondX, int secondY) {
    return new Edge(new Node(new BigDecimal(firstX), new BigDecimal(firstY)), new Node(new BigDecimal(secondX), new BigDecimal(secondY)));
  }
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
46
47
 
  public Graph<WeightedEdge> getTriangle(int which) {
    Graph<WeightedEdge> graph = new Graph<WeightedEdge>();
   
    try {
      Edge firstEdge = null;
      Edge secondEdge = null;
      Edge thirdEdge = null;
     
      switch(which) {
      case 1:
        // first one vertical line
        firstEdge = getEdge(0, 0, 0, 4);
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
31
  public static SteinerObjectsProvider objectsProvider = new SteinerObjectsProvider();
 
  @Test
  public void testGetGraphLeave(){
    Graph<Edge> graph = objectsProvider.getTreeGraph();
    Edge leave = null;
   
    leave = SteinersAlgorithm.getGraphLeave(graph);
   
    assertTrue(leave != null);
    assertTrue(graph.getNearNodes(leave.getStart()).size() == 1 || graph.getNearNodes(leave.getEnd()).size() == 1);
  }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
  @Test
  public void testGetAngleBetweenTwoEdges(){

    try {
     
      Edge firstEdge = objectsProvider.getEdge(0, 0, 0, 5);
      Edge secondEdge = objectsProvider.getEdge(0, 0, 3, 0);
      BigDecimal angle = SteinersAlgorithm.getAngleBetweenTwoEdges(firstEdge, secondEdge);
      assertTrue(angle.compareTo(BigDecimal.valueOf(90)) == 0);
     
      firstEdge = objectsProvider.getEdge(0, 0, 0, 5);
      secondEdge = objectsProvider.getEdge(0, 5, 0, 8);
View Full Code Here
55
56
57
58
59
60
61
62
63
64
    }
  }
 
  @Test
  public void testGetEdgeLength() {
    Edge edge = objectsProvider.getEdge(0, 0, 0, 2);
    BigDecimal length = SteinersAlgorithm.getEdgeLength(edge);
   
    assertTrue(length.compareTo(BigDecimal.valueOf(2)) == 0);
  }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
    assertTrue(length.compareTo(BigDecimal.valueOf(2)) == 0);
  }
 
  @Test
  public void testGetTriangleWithWeights() {
    Edge firstEdge = objectsProvider.getEdge(1, 1, 2, 3);
    Edge secondEdge = objectsProvider.getEdge(1, 1, 3, 1);
   
    Edge thirdEdge = objectsProvider.getEdge(2, 3, 3, 1);
    WeightedEdge addedEdge = new WeightedEdge(thirdEdge, SteinersAlgorithm.getEdgeLength(thirdEdge));
   
    Graph<WeightedEdge> triangle;
    try {
      triangle = SteinersAlgorithm.getTriangleWithWeights(firstEdge, secondEdge);
View Full Code Here
248
249
250
251
252
253
254
255
256
257
258
259
260
261
    }
  }
 
  @Test
  public void testLengths() {
    Edge firstEdge = new Edge(new Node(BigDecimal.valueOf(2), BigDecimal.valueOf(2)),
        new Node(BigDecimal.valueOf(6), BigDecimal.valueOf(6)));
   
    Edge secondEdge = new Edge(new Node(BigDecimal.valueOf(2), BigDecimal.valueOf(2)),
        new Node(BigDecimal.valueOf(7), BigDecimal.valueOf(4)));
   
    BigDecimal firstWeight = SteinersAlgorithm.getEdgeLength(firstEdge);
    BigDecimal secondWeight = SteinersAlgorithm.getEdgeLength(secondEdge);
   
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
        secondNode = secondEdge.getStart();
      }
      if (!secondEdge.getEnd().equals(commonPoint)) {
        secondNode = secondEdge.getEnd();
      }
      Edge thirdEdge = new Edge(firstNode, secondNode);
     
      Graph<WeightedEdge> triangle = new Graph<WeightedEdge>();
      triangle.addEdgeWithNodes(new WeightedEdge(firstEdge, SteinersAlgorithm.getEdgeLength(firstEdge)));
      triangle.addEdgeWithNodes(new WeightedEdge(secondEdge, SteinersAlgorithm.getEdgeLength(secondEdge)));
      triangle.addEdgeWithNodes(new WeightedEdge(thirdEdge, SteinersAlgorithm.getEdgeLength(thirdEdge)));
View Full Code Here
192
193
194
195
196
197
198
199
200
201
   
    Node newNode = new Node(turnedX, turnedY);
   
    Graph<WeightedEdge> equilateralTriangle = new Graph<WeightedEdge>();
    equilateralTriangle.addEdgeWithNodes(edge);
    equilateralTriangle.addEdgeWithNodes(new WeightedEdge(new Edge(edge.getStart(), newNode), edge.getWeight()));
    equilateralTriangle.addEdgeWithNodes(new WeightedEdge(new Edge(edge.getEnd(), newNode), edge.getWeight()));
   
    return equilateralTriangle;
  }
View Full Code Here
TOP

Related Classes of lt.refactory.primsAlgo.graph.Edge

  • lt.refactory.primsAlgo.algorithm.test.PrimsAlgorithmTest
  • lt.refactory.primsAlgo.algorithm.test.SteinerObjectsProvider
  • lt.refactory.primsAlgo.algorithm.test.SteinersAlgorithmTest
  • lt.refactory.primsAlgo.graph.mock.GraphMock
  • lt.refactory.primsAlgo.graph.test.GraphClassTest
  • lt.refactory.primsAlgo.graph.test.TestObjectsFactory
  • lt.refactory.primsAlgo.service.algorithm.SteinersAlgorithm
    • 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.