internal static void UnitTest(Digraph G, String description)
{
Console.WriteLine(description);
Console.WriteLine("-------------------------------------");
Console.Write(G);
DirectedEulerianCycle euler = new DirectedEulerianCycle(G);
Console.Write("Eulerian cycle: ");
if (euler.HasEulerianCycle)
{
foreach (int v in euler.GetCycle())
{
Console.Write(v + " ");
}
Console.WriteLine();
}
else
{
Console.WriteLine("none");
}
Console.WriteLine();
}
public static void MainTest(string[] args)
{
int V = int.Parse(args[0]);
int E = int.Parse(args[1]);
// Eulerian cycle
Digraph G1 = DigraphGenerator.EulerianCycle(V, E);
DirectedEulerianCycle.UnitTest(G1, "Eulerian cycle");
// Eulerian path
Digraph G2 = DigraphGenerator.EulerianPath(V, E);
DirectedEulerianCycle.UnitTest(G2, "Eulerian path");
// empty digraph
Digraph G3 = new Digraph(V);
DirectedEulerianCycle.UnitTest(G3, "empty digraph");
// self loop
Digraph G4 = new Digraph(V);
int v4 = StdRandom.Uniform(V);
G4.AddEdge(v4, v4);
DirectedEulerianCycle.UnitTest(G4, "single self loop");
// union of two disjoint cycles
Digraph H1 = DigraphGenerator.EulerianCycle(V / 2, E / 2);
Digraph H2 = DigraphGenerator.EulerianCycle(V - V / 2, E - E / 2);
int[] perm = new int[V];
for (int i = 0; i < V; i++)
{
perm[i] = i;
}
StdRandom.Shuffle(perm);
Digraph G5 = new Digraph(V);
for (int v = 0; v < H1.V; v++)
{
foreach (int w in H1.Adj(v))
{
G5.AddEdge(perm[v], perm[w]);
}
}
for (int v = 0; v < H2.V; v++)
{
foreach (int w in H2.Adj(v))
{
G5.AddEdge(perm[V / 2 + v], perm[V / 2 + w]);
}
}
DirectedEulerianCycle.UnitTest(G5, "Union of two disjoint cycles");
// random digraph
Digraph G6 = DigraphGenerator.Simple(V, E);
DirectedEulerianCycle.UnitTest(G6, "simple digraph");
// 4-vertex digraph - no data file
//Digraph G7 = new Digraph(new TextInput("eulerianD.txt"));
//DirectedEulerianCycle.UnitTest(G7, "4-vertex Eulerian digraph");
}
