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
|
/* ==========================================
* JGraphT : a free Java graph-theory library
* ==========================================
*
* Project Info: http://jgrapht.sourceforge.net/
* Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
*
* (C) Copyright 2003-2010, by Barak Naveh and Contributors.
*
* This library 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 2.1 of the License, or
* (at your option) any later version.
*
* This library 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 this library; if not, write to the Free Software Foundation,
* Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
*/
/* ------------------------------
* KruskalMinimumSpanningTreeTest.java
* ------------------------------
* (C) Copyright 2010-2010, by Tom Conerly and Contributors.
*
* Original Author: Tom Conerly
* Contributor(s): -
*
* Changes
* -------
* 02-Feb-2010 : Initial revision (TC);
*
*/
package org.jgrapht.alg;
import java.util.*;
import junit.framework.*;
import org.jgrapht.*;
import org.jgrapht.graph.*;
public class KruskalMinimumSpanningTreeTest
extends TestCase
{
//~ Static fields/initializers ---------------------------------------------
static final String V1 = "v1";
static final String V2 = "v2";
static final String V3 = "v3";
static final String V4 = "v4";
static final String V5 = "v5";
//~ Instance fields --------------------------------------------------------
DefaultWeightedEdge e12;
DefaultWeightedEdge e13;
DefaultWeightedEdge e15;
DefaultWeightedEdge e24;
DefaultWeightedEdge e34;
DefaultWeightedEdge e45;
//~ Methods ----------------------------------------------------------------
/**
* .
*/
public void testMinimumSpanningTree()
{
Graph<String, DefaultWeightedEdge> graph = createWeighted();
KruskalMinimumSpanningTree<String, DefaultWeightedEdge> mst =
new KruskalMinimumSpanningTree<String, DefaultWeightedEdge>(graph);
assertEquals(15.0, mst.getSpanningTreeCost());
Set<DefaultWeightedEdge> edges = mst.getEdgeSet();
for (DefaultWeightedEdge edge : edges) {
assertTrue(
edge.equals(e12) || edge.equals(e13) || edge.equals(e24)
|| edge.equals(e45));
}
}
protected Graph<String, DefaultWeightedEdge> createWeighted()
{
Graph<String, DefaultWeightedEdge> g;
double bias = 1;
g = new SimpleWeightedGraph<String, DefaultWeightedEdge>(
DefaultWeightedEdge.class);
g.addVertex(V1);
g.addVertex(V2);
g.addVertex(V3);
g.addVertex(V4);
g.addVertex(V5);
e12 = Graphs.addEdge(g, V1, V2, bias * 2);
e13 = Graphs.addEdge(g, V1, V3, bias * 3);
e24 = Graphs.addEdge(g, V2, V4, bias * 5);
e34 = Graphs.addEdge(g, V3, V4, bias * 20);
e45 = Graphs.addEdge(g, V4, V5, bias * 5);
e15 = Graphs.addEdge(g, V1, V5, bias * 100);
return g;
}
}
// End KruskalMinimumSpanningTreeTest.java
|
