6.4.1.1. algΒΆ

It contains basic algorithms, numerical tricks, and data processing tasks.

Functions

add_edge_fun Returns a function that adds an edge to the graph checking only the out node.
add_func_edges Adds function node edges.
dijkstra Compute shortest paths and lengths in a weighted graph.
get_full_pipe Returns the full pipe of a dispatch run.
get_sub_node Returns a sub node of a dispatcher.
get_unused_node_id Finds an unused node id in graph.
remove_edge_fun Returns a function that removes an edge from the graph.
remove_links
remove_remote_link
replace_remote_link Replaces or removes remote links.
rm_cycles_iter Identifies and removes the unresolved cycles.
scc_fun Return nodes in strongly connected components (SCC) of the reachable graph.
stlp

Classes

DspPipe