2023-09-08 20:32:03 -05:00
|
|
|
#include "algorithm.hpp"
|
2023-08-31 18:55:36 -05:00
|
|
|
#include <iostream>
|
|
|
|
|
2023-09-08 20:32:03 -05:00
|
|
|
int main(int argc, char* argv[]) {
|
|
|
|
if (argc != 2) {
|
|
|
|
std::cerr << "Usage: search-algorithms graphFile.txt" << std::endl;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
Graph newGraph = ReadInGraph(argv[1]);
|
|
|
|
newGraph.PrintGraph();
|
2023-09-10 16:29:15 -05:00
|
|
|
for (int i = 1; i < newGraph.nodeCount; i++) {
|
|
|
|
PrintSolution(BFS(newGraph, 1, i));
|
|
|
|
}
|
2023-08-31 18:55:36 -05:00
|
|
|
return 0;
|
|
|
|
}
|