public static void main(String[] args) {
String filename = args[0];
String delimiter = args[1];
String source = args[2];
StdOut.println("Zrodlo: " + source);
SymbolGraph sg = new SymbolGraph(filename, delimiter);
Graph G = sg.G();
if (!sg.contains(source)) {
StdOut.println(source + " nie wystepuje w bazie danych.");
return;
}
int s = sg.index(source);
BreadthFirstPaths bfs = new BreadthFirstPaths(G, s);
while (!StdIn.isEmpty()) {
String sink = StdIn.readLine();
if (sg.contains(sink)) {
int t = sg.index(sink);
if (bfs.hasPathTo(t)) {
for (int v : bfs.pathTo(t)) {
StdOut.println(" " + sg.name(v));
}
} else {
StdOut.println("Brak polaczenia");
}
} else {
StdOut.println(" Nie wystepuje w bazie danych.");
}
}
}
/**
* Reads in a social network from a file, and then repeatedly reads in individuals from standard
* input and prints out their degrees of separation. Takes three command-line arguments: the name
* of a file, a delimiter, and the name of the distinguished individual. Each line in the file
* contains the name of a vertex, followed by a list of the names of the vertices adjacent to that
* vertex, separated by the delimiter.
*/
public static void main(String[] args) {
String filename = args[0];
String delimiter = args[1];
String source = args[2];
// StdOut.println("Source: " + source);
SymbolGraph sg = new SymbolGraph(filename, delimiter);
Graph G = sg.G();
if (!sg.contains(source)) {
StdOut.println(source + " not in database.");
return;
}
int s = sg.index(source);
BreadthFirstPaths bfs = new BreadthFirstPaths(G, s);
while (!StdIn.isEmpty()) {
String sink = StdIn.readLine();
if (sg.contains(sink)) {
int t = sg.index(sink);
if (bfs.hasPathTo(t)) {
for (int v : bfs.pathTo(t)) {
StdOut.println(" " + sg.name(v));
}
} else {
StdOut.println("Not connected");
}
} else {
StdOut.println(" Not in database.");
}
}
}
