Even though this recipe is only defining a function, please take into consideration the comments in the code for better understanding of the implementation and code flow:
- Declare the GetPathDFS function:
public List<Vertex> GetPathDFS(GameObject srcObj, GameObject dstObj)
{
// next steps
}
- Establish whether input objects are null:
if (srcObj == null || dstObj == null)
return new List<Vertex>();
- Declare and initialize the variables we need for the algorithm:
Vertex src = GetNearestVertex(srcObj.transform.position); Vertex dst = GetNearestVertex(dstObj.transform.position); Vertex[] neighbours; Vertex v; int[] previous = new int[vertices.Count]; for (int i = 0; i < previous.Length; i++) previous[i] = -1; previous[src.id] ...
