for android app https://www.youtube.com/watch?v=vksmKKW6cXo
The shortest path problem in java can be defined for graphs whether undirected, directed, or mixed. It is defined here for undirected graphs; for directed graphs the definition of path requires that consecutive vertices be connected by an appropriate directed edge. https://en.wikipedia.org/wiki/A*_search_algorithm