From aefa8055c12ed35e49b09ce85ea0a3d1a3bc3c0e Mon Sep 17 00:00:00 2001 From: ApsisRS contributors Date: Fri, 2 Oct 2026 02:18:49 +0800 Subject: [PATCH] docs: remove a repeated Chinese paragraph in the routing module doc --- crates/network/apsis-routing/src/dijkstra.rs | 7 ------- 1 file changed, 7 deletions(-) diff --git a/crates/network/apsis-routing/src/dijkstra.rs b/crates/network/apsis-routing/src/dijkstra.rs index ab039c2..5d75094 100644 --- a/crates/network/apsis-routing/src/dijkstra.rs +++ b/crates/network/apsis-routing/src/dijkstra.rs @@ -9,13 +9,6 @@ //! maximum heap. The key is the tentative distance, and ties are broken by //! the node index so that the result is deterministic for a given topology. //! -//! 该算法是 Dijkstra 的，使用以暂定距离为键的二叉堆。代价为正，故某节点首次从 -//! 堆中取出时其距离即为最终，这使该算法精确。 -//! -//! 该堆是反转排序键上的最小堆，因为标准库的 -//! [`BinaryHeap`](std::collections::BinaryHeap) 是最大堆。键是暂定距离，并列时按 -//! 节点下标打破，使结果对给定拓扑是确定的。 -//! //! 某拓扑上的最短路径计算。 //! //! 该算法是 Dijkstra 的，使用以暂定距离为键的二叉堆。代价为正，故某节点首次从