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
|
/* ==========================================
* 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-2008, 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.
*/
/* -------------------
* EulerianCircuitTest.java
* -------------------
* (C) Copyright 2008-2008, by Andrew Newell and Contributors.
*
* Original Author: Andrew Newell
* Contributor(s): -
*
* $Id: EulerianCircuitTest.java 652 2008-12-24 21:26:17Z perfecthash $
*
* Changes
* -------
* 24-Dec-2008 : Initial revision (AN);
*
*/
package org.jgrapht.alg;
import junit.framework.*;
import org.jgrapht.*;
import org.jgrapht.generate.*;
import org.jgrapht.graph.*;
/**
* .
*
* @author Andrew Newell
*/
public class EulerianCircuitTest
extends TestCase
{
//~ Methods ----------------------------------------------------------------
/**
* .
*/
public void testEulerianCircuit()
{
UndirectedGraph<Object, DefaultEdge> completeGraph1 =
new SimpleGraph<Object, DefaultEdge>(
DefaultEdge.class);
CompleteGraphGenerator<Object, DefaultEdge> completeGenerator1 =
new CompleteGraphGenerator<Object, DefaultEdge>(
6);
completeGenerator1.generateGraph(
completeGraph1,
new ClassBasedVertexFactory<Object>(Object.class),
null);
// A complete graph of order 6 will have all vertices with degree 5
// which is odd, therefore this graph is not Eulerian
assertFalse(EulerianCircuit.isEulerian(completeGraph1));
assertTrue(
EulerianCircuit.getEulerianCircuitVertices(completeGraph1) == null);
UndirectedGraph<Object, DefaultEdge> completeGraph2 =
new SimpleGraph<Object, DefaultEdge>(
DefaultEdge.class);
CompleteGraphGenerator<Object, DefaultEdge> completeGenerator2 =
new CompleteGraphGenerator<Object, DefaultEdge>(
5);
completeGenerator2.generateGraph(
completeGraph2,
new ClassBasedVertexFactory<Object>(Object.class),
null);
assertTrue(EulerianCircuit.isEulerian(completeGraph2));
// There are 10 edges total in this graph, so an Eulerian circuit
// labeled by vertices should have 11 vertices
assertEquals(
11,
EulerianCircuit.getEulerianCircuitVertices(completeGraph2).size());
}
}
// End EulerianCircuitTest.java
|
