Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding algorithms - Coggle Diagram
Pathfinding algorithms
Pathfinding algorithms are essential in computer science and artificial intelligence for navigating and finding routes within a defined space. These algorithms are particularly vital in robotics, video games, logistics, and network routing.
-
search tree
A collection of objects or things known as nodes that are connected to one another to create the illusion of a hierarchy is what makes up a tree, a type of data structure used to represent data in a hierarchical way.
Binary Search Tree
A Binary Search Tree is a data structure used in computer science for organizing and storing data in a sorted manner. Each node in a Binary Search Tree has at most two children, a left child and a right child, with the left child containing values less than the parent node and the right child containing values greater than the parent node.
-
-
Measuring performance
-
-
Big-O notation
The common mathematical symbol Big-O indicates an algorithm's efficiency in the worst-case situation in relation to 10.