void Start()
{
Digraph G = new Digraph(txt);
int s = 2; //1 2 6
BreadthFirstDirectedPaths bfs = new BreadthFirstDirectedPaths(G, s);
for (int v = 0; v < G.V(); v++)
{
if (bfs.hasPathTo(v))
{
string str = (s + " to " + v + "\t(distance=" + bfs.DistTo(v) + "):\t");
foreach (int x in bfs.pathTo(v))
{
if (x == s)
{
str += x;
}
else
{
str += ("->" + x);
}
}
print(str);
}
else
{
print(s + " to " + v + ": not connected\n");
}
}
}
/**/ public static void main(string[] strarr)
{
In i = new In(strarr[0]);
Digraph digraph = new Digraph(i);
int num = Integer.parseInt(strarr[1]);
BreadthFirstDirectedPaths breadthFirstDirectedPaths = new BreadthFirstDirectedPaths(digraph, num);
for (int j = 0; j < digraph.V(); j++)
{
if (breadthFirstDirectedPaths.hasPathTo(j))
{
StdOut.printf("%d to %d (%d): ", new object[]
{
Integer.valueOf(num),
Integer.valueOf(j),
Integer.valueOf(breadthFirstDirectedPaths.distTo(j))
});
Iterator iterator = breadthFirstDirectedPaths.pathTo(j).iterator();
while (iterator.hasNext())
{
int num2 = ((Integer)iterator.next()).intValue();
if (num2 == num)
{
StdOut.print(num2);
}
else
{
StdOut.print(new StringBuilder().append("->").append(num2).toString());
}
}
StdOut.println();
}
else
{
StdOut.printf("%d to %d (-): not connected\n", new object[]
{
Integer.valueOf(num),
Integer.valueOf(j)
});
}
}
}
public void Run()
{
Console.WriteLine("Choose file:"); // Prompt
Console.WriteLine("1 - tinyDG.txt"); // Prompt
Console.WriteLine("2 - mediumDG.txt"); // Prompt
Console.WriteLine("or quit"); // Prompt
var fileNumber = Console.ReadLine();
string fileName;
switch (fileNumber)
{
case "1":
fileName = "tinyDG.txt";
break;
case "2":
fileName = "mediumDG.txt";
break;
case "quit":
return;
default:
return;
}
var @in = new In($"Files\\Graphs\\{fileName}");
var lines = @in.ReadAllLines();
var lineIterator = 0;
var v = 0;
var e = 0;
var edges = new List <EdgeD>();
foreach (var line in lines)
{
if (lineIterator == 0)
{
v = Convert.ToInt32(line);
}
if (lineIterator == 1)
{
e = Convert.ToInt32(line);
}
if (lineIterator > 1)
{
var lineSplitted = line.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
var ve = Convert.ToInt32(lineSplitted[0]);
var we = Convert.ToInt32(lineSplitted[1]);
var edge = new EdgeD(ve, we);
edges.Add(edge);
}
lineIterator++;
}
var digraph = new Digraph(v, e, edges);
Console.WriteLine(digraph);
Console.WriteLine("------------------------------------------------------");
const int s = 3;
var bfs = new BreadthFirstDirectedPaths(digraph, s);
for (var i = 0; i < digraph.V; i++)
{
if (bfs.HasPathTo(i))
{
Console.Write($"{s} to {i} ({bfs.DistTo(i)}): ");
foreach (int x in bfs.PathTo(i))
{
if (x == s)
{
Console.Write(x);
}
else
{
Console.Write("->" + x);
}
}
Console.WriteLine();
}
else
{
Console.Write($"{s} to {i} (-): not connected{Environment.NewLine}");
}
}
Console.ReadLine();
}
