Use Turbowarp when searching through large amounts of data: https://turbowarp.org/1385333077?turbo --What is BFS-- Breadth First Search is an algorithm that searches the neighbors between two seemingly unrelated things to find a connection. It navigates to find the shortest path between 2 things in a complex network. --What it's used for-- - Finding the exit in a maze. - Finding connections between friends on a social media platform -Puzzle Solving -Searching through files -Navigation app --How to understand the project-- 1. The "Connections" list contains the network full of parents and neighbors. 2. The "-" in front of the name of the node means that it is the parent of the nodes below it. (You will see that if you scroll to the neighbor of a certain node, it's neighbors with the same node) 3. The "-" by itself means that the neighbors for a node have ended and that it's moving onto another node. --How to create a network-- 1. There is already a simple network in the "Connections" list that you can search. 2. Creating a network is tedious as it has to follow certain rules (the project will analyze the network to made sure it's complete). 3. When the project "analyses" it's making sure that every node is neighbors with each other and that there isn't an extra "neighbor" node that isn't a parent. 4. Since you know what is needed to create a network to search, it's up to you how you want to create it if that's your goal. 5. You can import it into the "Connections" list as a text file. --How to use the project-- 1. Follow the directions in the project. 2. It first analyses the network and prompts you to hit enter to continue after. 3. You "Connect" a node that is included in the list to another node that is in the list. 4. You may or may not have to wait for it to process after.
https://www.youtube.com/watch?v=xlVX7dXLS64 All code by me #Breadth-First-Search #BFS #Algorithm #Searching-Algorithm
