Answer Happy

***in java, MUST include 3 files like mentioned***
***Stop copying the answer provided in the link below***
***another report will be giving for copying answers***
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
https://www.answers.com/homework-help/que ... d=DTazEduC
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
graph.txt - Must read this graph from an input file
Using a high-level programming language, e.g., Java or C/C++, implement the following Breadth-First Search (BFS) algorithm: BFS (s): Set Discovered [s] = true and Discovered [v] = false for all other v Initialize L[0] to consist of the single element s Set the layer counter i = 0 Set the current BFS tree T = 0 While Li] is not empty Initialize an empty list L[i+1] For each node u € L Consider each edge (u, v) incident to U If Discovered [v] = false then Set Discovered [v] = true Add edge (u, v) to the tree T Add to the list L[i+1] Endif Endfor Increment the layer counter i by one Endwhile In your implementation, use adjacency list to ensure O(m + n) space for representing graphs. Also, ensure to have a 0(m + n) running time as you implement the BFS (s) function. Additionally, follow the demo of this project discussed in class regarding the syntax and structure of your imple- mentation. For example, your code should have the following three files if you implement the project in Java programming language: 1. Node.java (a class file that implements node of a graph) 2. LinkedList. java (a class file that implements various linked list operation for representing a graph using adjacency list) 3. BFSTest.java (a driver class file that reads a graph file, implements the BFS algorithm, and outputs the BFS tree)
HO TUTO H TOOTE