Graph Data Structure 7. A* Pathfinding VB.NET Implementation
4,676 views · Published 19 March 2017 · 13:53 · Indexed 23 September 2026
Channel: Computer Science Lessons · 2017 · Education
This is the seventh in a series of videos about the graph data structure. It describes a Visual Basic.NET implementation of the A* pathfinding algorithm (pronounced A Star) for a weighted, undirected graph. The algorithm was described in a previous video. The A* pathfinding algorithm, and its numerous variations, is widely used in applications such as games programming, natural language processing, financial trading systems, town planning and even space exploration. This implementation makes use of a graph class and a separate vertex class. The vertex class includes properties specifically for use by the A* program. The A* code is implemented as a method of the graph class. This is considered to be a partially object oriented approach, because the edges of the graph are represented by an adjacency matrix, which itself is a two dimensional array of integers. This implementation makes use of Euclidean distances for the heuristic. It shows that an alternative heuristic, in this case Manhattan distances, may produce a different result, albeit correct.
More from this channel
-
4:18
10. Introduction to Programming with VBA - The Variant Data Type
-
7:07
15. Introduction to Programming with VBA - The Block If Construct
-
3:50
18. Introduction to Programming with VBA - The Select Construct
-
6:11
22. Introduction to Programming with VBA - Array Variables
-
5:57
Tomorrow’s Teenagers
-
10:06
How to Make a Hangman Game with VBA. Part 5 – Checking for Correct Guesses