Graph Traversal, Systematic process of visiting vertices in a graph, Depth-First Search (DFS), Traversal that explores as far as possible along one path before backtracking, Breadth-First Search (BFS), Traversal that visits all neighbouring vertices before moving to the next level, Tree Traversal, Systematic process of visiting every node in a tree, Pre-order Traversal, Visits the root before recursively visiting its subtrees, In-order Traversal, For a binary tree, visits the left subtree, root, then right subtree, Post-order Traversal, Visits the subtrees before visiting the root, Dijkstra's Algorithm, Algorithm that finds shortest paths from a starting vertex in a weighted graph with non-negative edge weights, A* Algorithm, Pathfinding algorithm combining the cost already travelled with a heuristic estimate of the remaining cost, Heuristic Function, Function estimating the remaining cost from the current location to the goal
0%
A Level: Graph and Tree Algorithms - Mr Gopal
Share
Share
by
Mrgopal
Secondary
KS5
Computing
Algorithms
Edit Content
Print
Embed
More
Assignments
Leaderboard
Show more
Show less
This leaderboard is currently private. Click
Share
to make it public.
This leaderboard has been disabled by the resource owner.
This leaderboard is disabled as your options are different to the resource owner.
Revert Options
Match up
is an open-ended template. It does not generate scores for a leaderboard.
Log in required
Visual style
Fonts
Subscription required
Options
AI Enhanced: This activity contains content generated by AI.
Learn more.
Switch template
Show all
Open results
Copy link
QR code
Delete
Continue editing:
?
