Node getMostAvailableNode(List <Node> nodeList) { BFSSearch bfs = new BFSSearch(); return(bfs.searchNearestNode(transform.position, nodeList, grid)); }
Node getMostAvailableNode(List < Node > nodeList) { BFSSearch bfs = new BFSSearch(); return bfs.searchNearestNode(transform.position, nodeList, grid); }