dynetx.algorithms.paths.annotate_paths

dynetx.algorithms.paths.annotate_paths(paths)

Annotate a set of paths identifying peculiar types of paths.

• shortest: topological shortest paths

• fastest: paths that have minimal duration

• foremost: first paths that reach the destination

• shortest fastest: minimum length path among minimum duration ones

• fastest shortest: minimum duration path among minimum length ones

Parameters

pathslist

a list of paths among a same node pair

Returns

annotated: dictionary

A mapping for shortest, fastest, foremost, fastest_shortest and shortest_fastest paths.

Examples

>>> import dynetx as dn
>>> g = dn.DynGraph()
>>> g.add_interaction("A", "B", 1, 4)
>>> g.add_interaction("B", "D", 2, 5)
>>> g.add_interaction("A", "C", 4, 8)
>>> g.add_interaction("B", "D", 2, 4)
>>> g.add_interaction("B", "C", 6, 10)
>>> g.add_interaction("B", "D", 2, 4)
>>> g.add_interaction("A", "B", 7, 9)
>>> paths = al.time_respecting_paths(g, "D", "C", start=1, end=9)
>>> annotated = al.annotate_paths(paths)