Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding Algorithms - Coggle Diagram
Pathfinding Algorithms
Genetic Algorithms
Genetic algorithms use natural selection principles to efficiently solve complex optimization problems across various fields .
-
How GA works
-
Fitness assignment : The fitness function helps in establishing the fitness of all individuals in the population.
-
-
-
Searching Algorithms
Uninformed Search
Uninformed search algorithms explore possible solutions without domain-specific knowledge, relying solely on the problem definition to find a goal.
-
-
-
-
-
-
-
Informed Search (Heuristic)
Informed Search algorithms have information on the goal state which helps in ore efficient searching.
-
-
-
-
Slime Mould : A simple organism that consists of an acellular mass of creeping jelly-like protoplasm containing nuclei, or a mass of amoeboid cells. When it reaches a certain size it forms many spore cases.
Measuring Performance
Time Complexity : The mount of time taken by an algorithm to run, as a function of the length of thr input.
-
-
-
Big-O notation : Big-O is a standard mathematical notation that shows how efficient n algorithm is in the worst-case scenario relative to its input size. Ex; Constant )(1) ,logarithmic O (logn)
Search Tree
A search tree is a data structure used in search algorithms to systematically explore all possible states or solutions of a problem, starting from an initial state and expanding nodes to reach a goal state.
Binary Search Tree
A binary search tree (BST) is a hierarchical data structure in which each node has at most two children. The left child's value is less than its parent node's value, while the right child's value is greater. This property allows for efficient searching, insertion, and deletion operations, making BSTs fundamental in computer science for managing ordered data.