Please enable JavaScript.
Coggle requires JavaScript to display documents.
Path Finding Algorithms - Coggle Diagram
Path Finding Algorithms
Genetic Algorithms: Reflex the processes of natural selection where the fittest individuals are selected for reproduction in order to produce offspring of the next generation.
-
-
Searching Algorithms
Uninformed Search: No additional Information on the goal node except the problem provided in the definition
-
-
-
-
-
-
-
-
Measuring Performance:
-
-
Optimality: the point where the difference between advantages and the cost of the behavior is calculated
-
Big-O notation: this is a standard mathematical operation. this shows how the algorithm is efficient even in the worst-case scenario.
Search Tree: a tree is a type of data structure which is used to present data in a hierarchical form. this is a group of objects and entities which has another name as nodes which are attached together to produce a hierarchy.
Binary Search Tree: This follows some order to arrange the elements. The worth must be smaller than the parent node and considering the right node it should be bigger than the parent mode.