collaborators

1 paper

math.OC2025

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm

Cong-Dian Cheng

Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-sourc…