Is there a way to get distance of shortest path from A*

[d3netxer]

Reason or Problem

I ran the Pathfinding_Austin_Road_Network notebook and I was wondering if there is a way to get the distance of the shortest path? I am noticing that path finding algorithm returns a 2D array.