Johnson
johnson(graph) computes all-pairs shortest paths for sparse weighted graphs by combining reweighting with Dijkstra. A negative cycle returns Err(AlgorithmError) with code ERR_ALGORITHM_NEGATIVE_CYCLE; propagate it with ? or handle it with match.
| Signature | Returns | Complexity |
|---|---|---|
johnson(adj: [usize, i32][][]) | Result<(i32?)[][], AlgorithmError> | O(VE + V(V + E) log V) |
tyrus
import { AlgorithmError, johnson } from "tyrus:algorithm";
const showDistances = (): Result<void, AlgorithmError> => {
const distances = johnson([[[1, 4], [2, 2]], [[3, 5]], [[3, 1]], []])?;
print(distances[0][3] ?? -1); // 3
return Ok();
};
match (showDistances()) {
Ok(_) => {}
Err(error) => { printError(error.code); // ERR_ALGORITHM_NEGATIVE_CYCLE
}
}Study result
johnsonInfo returns Result<JohnsonInfo, AlgorithmError> with the all-pairs distance matrix, reweighting count, initial Bellman-Ford relaxation count, and Dijkstra execution count.
tyrus
interface JohnsonInfo {
distances: i32?[][];
reweightingCount: usize;
bellmanFordRelaxationCount: usize;
dijkstraExecutionCount: usize;
}tyrus
import { AlgorithmError, JohnsonInfo, johnsonInfo } from "tyrus:algorithm";
const showStudy = (): Result<void, AlgorithmError> => {
const info: JohnsonInfo = johnsonInfo([[[1, 4], [2, 1]], [[3, 1]], [[1, 2], [3, 5]], []])?;
print(info.distances[0][3] ?? -1); // 4
print(info.reweightingCount); // 5
print(info.bellmanFordRelaxationCount); // 4
print(info.dijkstraExecutionCount); // 4
return Ok();
};
match (showStudy()) {
Ok(_) => {}
Err(error) => { printError(error.code); // ERR_ALGORITHM_NEGATIVE_CYCLE
}
}