shortest distance in filtered graph doesn't work properly

graph-tool
1

Hello,

I'm using a graph filtered with the minimum spanning tree and
calculating the shortest distance for all the vertices.

when capturing the array of distances for the vertex with index 0 it gives me:

dist1

array([ 0, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 1, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 1, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647, 2147483647, 2147483647, 2147483647, 2147483647,
       2147483647], dtype=int32)

as if the algorithm were checking for a direct edge between each pair
of vertices instead of searching for the shortest path and giving the
appropriate distance.

Is there another way to get the right values?

2

Hello,

I'm using a graph filtered with the minimum spanning tree and
calculating the shortest distance for all the vertices.

when capturing the array of distances for the vertex with index 0 it gives me:

[...]

as if the algorithm were checking for a direct edge between each pair
of vertices instead of searching for the shortest path and giving the
appropriate distance.

Are you sure your graph is undirected?

Please provide a complete example so I can understand what is going on.

Cheers,
Tiago