Concept贝尔曼-福特算法
Bellman-Ford
A classical single-source shortest-path algorithm. It updates vertex distances by repeatedly relaxing edges and produces a stable solution after at most |V|-1 rounds.
Timeline (last 90 days)
Oct 18
Knock-on delay propagation can be implemented by repeatedly executing a Cypher query in the database until changed=0, which is equivalent to Bellman-Ford relaxation to a fixed point.
Unverified50%