SHORTEST PATH ALGORITHM FOR SOME GRAPHS BEFORE AND AFTER FOLDING
H. El-Zohny, Hend El- Morsy · International Journal of Pure and Apllied Mathematics · 2012
In this paper we will compute shortest path algorithm for some graphs before and after folding and we will show that the algorithm change for once and the algorithm will not be change in bipartite graph whatever we start at parent vertex or child. Finally if the geometric shape change then the algorithm change.