CST 370 Week 3

 My studies this week revolved around different search algorithms. The exhaustive search algorithm for graphs is fairly straightforward as it involves finding solutions by testing all possible combinations of paths. Although simple in concept, this approach can be extremely inefficient since the number of possible paths grows rapidly as the number of nodes in a graph increases. I also learned how to perform a DFS to traverse a graph, which finds the furthest unvisited node before back tracking. This strategy adds nodes to a stack and ensures the deepest nodes are visited first. The material this week also covered performing BFS, which involves exploring the nodes adjacent to the current node first. This strategy uses a queue to ensure the closest nodes are visited first. 

Comments

Popular posts from this blog

CST 300 week 8

CST 300 Week 5

CST 363 Week 8