Dijkstra’s algorithm – an algorithm that finds the shortest path between two nodes or vertices in a graph/network.
Describe A* algorithm
A* algorithm – an algorithm that finds the shortest route between nodes or vertices but uses an additional heuristic approach to achieve better performance than
Machines that think in a way similar to the human brain. They handle huge amounts of data using artificial neural networks.
Deep Learning
Unlock this slideshow and over 4 million more with Baamboozle+