dijkstra_distances

compas.topology.dijkstra_distances(adjacency, weight, target)[source]

Compute Dijkstra distances from all nodes in a graph to one target node.

Parameters

  • adjacency (dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]) – An adjacency dictionary representing the connectivity of the graph by mapping nodes identifiers to neighbour identifiers. Examples of valid adjacency dicts are

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

    • {0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}

  • weight (dict[tuple[hashable, hashable], float]) – A dictionary of edge weights.

  • target (hashable) – The key of the vertex to which the distances are computed.

Returns

dict[hashable, float] – A dictionary of distances to the target.