Search algorithms

Search algorithms

1. Basic

   • Search and traverse of trees and graphs
   • The solution is reach iterating through a loop
   • Classifies the information in open and close nodes
     • Open: Nodes not visited
     • Closed: Nodes visited

2. General

   • Uses cycles but with more elements
     • Adding or deleting
     • Vary visiting order

3. Iteration classification

   • Blind
     • Do not consider the cost
     • Iterate through nodes in order
   • Informed (heuristic)
     • Estimate of the solution cost
     • Take decisions