0a5f6a8047
- Go backend (server/)
- Frontend (web/, server/static/)
- Database and deployment files
- Scripts and docs
Co-Authored-By: 狸花猫/Claude-Qwen3.6-Plus 🐾
66 lines
1.9 KiB
JavaScript
66 lines
1.9 KiB
JavaScript
/**
|
||
* @description Tarjan's algorithm for finding the strongly connected components of a graph.
|
||
* @description https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
|
||
* @description.zh-CN Tarjan 算法用于找到图的强连通子图。
|
||
* @param graph
|
||
* @returns
|
||
*/
|
||
var tarjan = function tarjan(graph) {
|
||
var index = 0;
|
||
var stack = [];
|
||
var visited = new Map(); // node id -> { onStack, lowlink, index }
|
||
|
||
var results = [];
|
||
|
||
function dfs(v) {
|
||
var _graph$successors;
|
||
|
||
var entry = {
|
||
onStack: true,
|
||
lowlink: index,
|
||
index: index
|
||
};
|
||
visited.set(v, entry);
|
||
index += 1;
|
||
stack.push(v);
|
||
(_graph$successors = graph.successors(v)) === null || _graph$successors === void 0 ? void 0 : _graph$successors.forEach(function (w) {
|
||
var _visited$get;
|
||
|
||
// 如果 w 没有被访问过，则继续访问 w
|
||
if (!visited.has(w)) {
|
||
dfs(w);
|
||
var wEntry = visited.get(w);
|
||
entry.lowlink = Math.min(entry.lowlink, wEntry.lowlink); // 如果 w 在栈顶，则说明 w 和 v 不是强连通的
|
||
} else if ((_visited$get = visited.get(w)) === null || _visited$get === void 0 ? void 0 : _visited$get.onStack) {
|
||
var _wEntry = visited.get(w); // 如果 w 在栈中，则说明 w 在当前访问的路径上
|
||
|
||
|
||
entry.lowlink = Math.min(entry.lowlink, _wEntry.index);
|
||
}
|
||
}); // 如果 v 的 lowlink 不等于 v 的 index，则说明 v 和 v 的 lowlink 不是强连通的
|
||
|
||
if (entry.lowlink === entry.index) {
|
||
var cmpt = [];
|
||
var w;
|
||
|
||
do {
|
||
// 将 w 出栈，并将 w 的所有邻接点加入强连通子图
|
||
w = stack.pop();
|
||
var wEntry = visited.get(w);
|
||
wEntry.onStack = false;
|
||
cmpt.push(w);
|
||
} while (v !== w);
|
||
|
||
results.push(cmpt);
|
||
}
|
||
}
|
||
|
||
graph.nodes().forEach(function (v) {
|
||
if (!visited.has(v)) {
|
||
dfs(v);
|
||
}
|
||
});
|
||
return results;
|
||
};
|
||
|
||
export default tarjan; |