Package de.timefinder.algo.graph

Examples of de.timefinder.algo.graph.WeightedGraph.addEdge()

54
55
56
57
58
59
60
61
62
63
64
        int ALL_NODES = NO_X + NO_Y;
        for (int x = 0; x < NO_X; x++) {
            int tmpY = 0;
            for (int y = NO_X; y < ALL_NODES; y++, tmpY++) {
                if (costMatrix[tmpY][x] < floatMax) {
                    graph.addEdge(x, y, costMatrix[tmpY][x]);
                } else {
                    // we would not need this line, if we would have a better graph.getOneNodeWithAnEdge()
                    // see within the while(true) loop
                    graph.addEdge(x, y, floatMax);
                }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
                if (costMatrix[tmpY][x] < floatMax) {
                    graph.addEdge(x, y, costMatrix[tmpY][x]);
                } else {
                    // we would not need this line, if we would have a better graph.getOneNodeWithAnEdge()
                    // see within the while(true) loop
                    graph.addEdge(x, y, floatMax);
                }
            }
        }

        // x is somewhat missleading, because the x and y nodes swap
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
    @Test
    public void testAddEdge() {
        System.out.println("addEdge");

        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 8f);
        graph.addEdge(2, 4, 9f);

        assertEquals(2, graph.getNoOfEdges());
        assertTrue(graph.getNeighbors(4).containsValue(8f));
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
    public void testAddEdge() {
        System.out.println("addEdge");

        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 8f);
        graph.addEdge(2, 4, 9f);

        assertEquals(2, graph.getNoOfEdges());
        assertTrue(graph.getNeighbors(4).containsValue(8f));
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
        System.out.println("addEdge");

        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 8f);
        graph.addEdge(2, 4, 9f);

        assertEquals(2, graph.getNoOfEdges());
        assertTrue(graph.getNeighbors(4).containsValue(8f));

        boolean ret = graph.removeEdge(3, 4);
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
    @Test
    public void testGetNeighbors() {
        System.out.println("getNeighbors");

        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(2, 4, 7f);

        assertEquals(1, graph.getNeighbors(2).size());
        assertEquals(2, graph.getNeighbors(4).size());
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
    public void testGetNeighbors() {
        System.out.println("getNeighbors");

        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(2, 4, 7f);

        assertEquals(1, graph.getNeighbors(2).size());
        assertEquals(2, graph.getNeighbors(4).size());
    }
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
        System.out.println("getNeighbors");

        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(2, 4, 7f);

        assertEquals(1, graph.getNeighbors(2).size());
        assertEquals(2, graph.getNeighbors(4).size());
    }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
     */
    @Test
    public void testGetOneNodeWithAnEdge() {
        System.out.println("getOneNodeWithAnEdge");
        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(2, 4, 7f);

        assertTrue(graph.getOneNodeWithAnEdge() != -1);

View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    @Test
    public void testGetOneNodeWithAnEdge() {
        System.out.println("getOneNodeWithAnEdge");
        WeightedGraph graph = new WeightedGraph(10);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(3, 4, 7f);
        graph.addEdge(2, 4, 7f);

        assertTrue(graph.getOneNodeWithAnEdge() != -1);

        graph.removeEdge(3, 4);
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.