- raphtory.algorithms.temporally_reachable_nodes(g, max_hops, start_time, seed_nodes, stop_nodes=None)#
Temporally reachable nodes – the nodes that are reachable by a time respecting path followed out from a set of seed nodes at a starting time.
This function starts at a set of seed nodes and follows all time respecting paths until either a) a maximum number of hops is reached, b) one of a set of stop nodes is reached, or c) no further time respecting edges exist. A time respecting path is a sequence of nodes v_1, v_2, … , v_k such that there exists a sequence of edges (v_i, v_i+1, t_i) with t_i < t_i+1 for i = 1, … , k - 1.
g (Raphtory graph) – directed Raphtory graph
max_hops (int) – maximum number of hops to propagate out
start_time (int) – time at which to start the path (such that t_1 > start_time for any path starting from these seed nodes)
seed_nodes (list(str) or list(int)) – list of vertex names or ids which should be the starting nodes
stop_nodes (list(str) or list(int)) – nodes at which a path shouldn’t go any further
AlgorithmResult with string keys and float values mapping vertex names to their pagerank value.
- Return type:
- raphtory.algorithms.single_source_shortest_path(g, source, cutoff=None)#
Calculates the single source shortest paths from a given source vertex.
g (Raphtory Graph) – A reference to the graph. Must implement GraphViewOps.
source (InputVertex) – The source vertex. Must implement InputVertex.
cutoff (Int, Optional) – An optional cutoff level. The algorithm will stop if this level is reached.
Returns an AlgorithmResult<String, Vec<String>> containing the shortest paths from the source to all reachable vertices.
- raphtory.algorithms.dijkstra_single_source_shortest_paths(g, source, targets, weight=...)#
Finds the shortest paths from a single source to multiple targets in a graph.
g (Raphtory Graph) – The graph to search in.
source (InputVertex) – The source vertex.
targets (List(InputVertices)) – A list of target vertices.
weight (String, Optional) – The name of the weight property for the edges (“weight” is default).
Returns a Dict where the key is the target vertex and the value is a tuple containing the total cost and a vector of vertices representing the shortest path.