java-network-analyzer/src/test/java/org/javanetworkanalyzer/alg/StrahlerTest.java at d0eb3795669ef22d20d38c804a079f7e4be621dd · ebocher/java-network-analyzer · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
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
/*
 * Java Network Analyzer provides a collection of graph theory and social
 * network analysis algorithms implemented on mathematical graphs using the
 * <a href="http://www.jgrapht.org/">JGraphT</a> library.
 *
 * Java Network Analyzer is developed by the GIS group of the DECIDE team of the
 * Lab-STICC CNRS laboratory, see <http://www.lab-sticc.fr/>.
 * It is part of the OrbisGIS tool ecosystem.
 *
 * The GIS group of the DECIDE team is located at :
 *
 * Laboratoire Lab-STICC – CNRS UMR 6285
 * Equipe DECIDE
 * UNIVERSITÉ DE BRETAGNE-SUD
 * Institut Universitaire de Technologie de Vannes
 * 8, Rue Montaigne - BP 561 56017 Vannes Cedex
 *
 * Java Network Analyzer is distributed under LGPL 3 license.
 *
 * Copyright (C) 2012-2014 CNRS (IRSTV CNRS FR 2488)
 * Copyright (C) 2015-2018 CNRS (Lab-STICC CNRS UMR 6285)
 *
 * Java Network Analyzer is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation, either version 3 of the License, or (at your option) any
 * later version.
 *
 * Java Network Analyzer is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
 * details.
 *
 * You should have received a copy of the GNU Lesser General Public License along with
 * Java Network Analyzer. If not, see <http://www.gnu.org/licenses/>.
 *
 * For more information, please consult: <http://www.orbisgis.org/>
 * or contact directly:
 * info_at_ orbisgis.org
 */
package org.javanetworkanalyzer.alg;

import org.javanetworkanalyzer.data.VStrahler;
import org.javanetworkanalyzer.model.Edge;
import org.javanetworkanalyzer.model.StrahlerTree;
import org.junit.jupiter.api.Test;

import java.lang.reflect.InvocationTargetException;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

import static org.junit.jupiter.api.Assertions.assertEquals;

/**
 * Tests calculating the Strahler numbers of the nodes in a tree.
 *
 * @author Adam Gouge
 */
public class StrahlerTest {

    /**
     * Tests the {@link #prepareTree()} tree.
     *
     */
    @Test
    public void testStrahler() {

        StrahlerTree<Edge> tree = prepareTree();

        new DFSForStrahler<Edge>(tree)
                .calculate(tree.getRootVertex());

        // We know what the answers should be.
        Set<Integer> s1 = new HashSet<Integer>(
                Arrays.asList(2, 6, 7, 9, 10, 11, 14, 15, 17, 19, 20));
        Set<Integer> s2 = new HashSet<Integer>(
                Arrays.asList(5, 8, 12, 13, 16, 18));
        Set<Integer> s3 = new HashSet<Integer>(
                Arrays.asList(1, 3, 4));
        // Check the Strahler numbers.
        for (VStrahler node : tree.vertexSet()) {
            int id = node.getID();
            int strahlerNumber = node.getStrahlerNumber();
            if (s1.contains(id)) {
                assertEquals(1, strahlerNumber);
            } else if (s2.contains(id)) {
                assertEquals(2, strahlerNumber);
            } else if (s3.contains(id)) {
                assertEquals(3, strahlerNumber);
            }
        }
    }

    /**
     * Prepare a tree with root node 1.
     *
     * @return A tree with root node 1.
     */
    protected StrahlerTree<Edge> prepareTree() {

        StrahlerTree<Edge> graph =
                new StrahlerTree<Edge>(Edge.class);

        graph.addEdge(1, 2);
        graph.addEdge(1, 3);

        graph.addEdge(3, 4);
        graph.addEdge(3, 12);

        graph.addEdge(4, 5);
        graph.addEdge(4, 8);

        graph.addEdge(5, 6);
        graph.addEdge(5, 7);

        graph.addEdge(8, 9);
        graph.addEdge(8, 10);
        graph.addEdge(8, 11);

        graph.addEdge(12, 13);

        graph.addEdge(13, 14);
        graph.addEdge(13, 16);

        graph.addEdge(14, 15);

        graph.addEdge(16, 17);
        graph.addEdge(16, 18);

        graph.addEdge(18, 19);
        graph.addEdge(18, 20);

        // Set the root vertex.
        graph.setRootVertex(1);

        return graph;
    }
}