Mindmap
Search Algorithms
Inhalt der Mindmap
Search Algorithms
Basic
- Trees & graphs
- Solution is reach using a loop
- Open and close nodes
- Open: Nodes not visited
- Close: Nodes visited
General
- Uses cycles with more elements
- Vary visiting order
- Adding or deleting
- Uses cycles with more elements
Iteration classification
- Blind
- No cost consideration
- iterate in order
- Informed (heuristic)
- take decisions
- estimate cost
- Blind
Informationen
- Beschreibung
- Mindmap am Search Algorithms, erstellt von Jorge Betancourt am 21/10/2020.
- Erstellt von
- Jorge Betancourt
- Aufrufe
- 0
- Bewertung