Estimation of shortest path number of hops.

Is there any network (graph) metrics that helps estimating number of hops of a shortest path in a weighted graph without any dependence on edges weights .

Only estimating hope counts , like: The shortest path between Nodes A and B may lay in path of hops : 6 and 8 .