I have used Dijkstra's algorithm for shortest path which enables bots to find their way across a 2D platform game setup. It doesnt use any 3rd party plugins and is all native C2 events.At the beginning of the level, the algorithm executes and starts calculating paths between all connected nodes. A static tree is created in a 3D array object.The bot then uses this to reach a destination platform given its current platform.