efficient way of calculating shortest path and distance with python's graph-tool

Question

I have a dictionary representing origin and destination vertices, for example:

{
    0: [1,3],
    1: [0,2],
    2: [1],
    3: [0,1,2],
}

Th