Scribd
Upload
10 views

Astart and dijkstra's cornell notes

Uploaded by

joshua.holloway2007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

Astart and dijkstra's cornell notes

Uploaded by

joshua.holloway2007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Video Title: Topic/SLR:

N/A A* and Dijkstra’s

Questions Notes

What is the A* A* algorithm is a pathfinding algorithm which finds the shortest path between two
pathfinding algorithm? nodes on a weighted, directed graph, the A* algorithm also includes heuristics, these
allow for the algorithm to not have to visit all nodes on the graph as the next node it
visits is the node with the lowest f value (heuristic + distance from start).

What is Dijkstra’s Dijkstra’s algorithm is a pathfinding algorithm which finds the shortest path between
algorithm and why is A* two nodes on a weighted, directed graph, based on each nodes distance from its
more efficient? previous node + its previous nodes distance from start, this will visit all nodes in the
graph and therefore is less efficient than the A* algorithm provided the calculation of
the heuristics is correct and the calculation of the heuristics isn’t too long.

What are heuristics? Heuristic - A next best guess to a problem that would take too long/ would be
impossible to solve in a realistic amount of time with the current computational
power, this provides a good enough solution to an unsolvable problem.

Key Terms

Heuristics Node
F value Graph

You might also like