All-Pairs Shortest Paths (APSP)
       For either a directed or an undirected graph, return the APSP object
       describing all the possible paths between any two vertices of the
       graph.  If no weight is defined for an edge, 1 (one) is assumed.