Question: A question in Graph theory using theory

Kind help Given graph G and an edge say (u,v) 

how to get the number of vertices of G which are shorter distance v than from the vertex u

Similiarly the number of vertices of G which are shorter distance u than from the vertex v

 

Kind help if anyone possible. I apologize to distrurb I would 200% acknowedge and merit your efforts.  

Please Wait...