🥮 mooncakes.io
    Sign in

    alicedhaha/moonrcinspect/src/path does not have a README file

    PathDistance

    source
    pub(all) struct PathDistance {
      source : String
      target : String
      reachable : Bool
      resistance : Double
      edge_count : Int
    } derive(
    Debug    )

    PathHop

    source
    pub(all) struct PathHop {
      node_id : Int
      node_name : String
      via_resistor_id : Int?
      edge_resistance : Double
      cumulative_resistance : Double
    } derive(
    Debug    )

    PathMatrix

    source
    pub(all) struct PathMatrix {
      status : PathStatus
      net_name : String
      nodes : Array[String]
      distances : Array[PathDistance]
      reachable_pair_count : Int
      unreachable_pair_count : Int
      diameter : PathDistance?
    } derive(
    Debug    )

    PathMatrix::find

    source
    fn PathMatrix::find(self : PathMatrix, first : String, second : String) -> PathDistance?

    PathResult

    source
    pub(all) struct PathResult {
      status : PathStatus
      net_name : String
      source : String
      target : String
      hops : Array[PathHop]
      total_resistance : Double
      edge_count : Int
    } derive(
    Debug    )

    PathResult::contains_node

    source
    fn PathResult::contains_node(self : PathResult, name : String) -> Bool

    PathResult::node_names

    source
    fn PathResult::node_names(self : PathResult) -> Array[String]

    PathResult::resistor_ids

    source
    fn PathResult::resistor_ids(self : PathResult) -> Array[Int]

    PathStatus

    source
    pub(all) enum PathStatus {
      Found
      EmptyNetwork
      UnknownSource
      UnknownTarget
      Unreachable
      InvalidResistance
      NoDriver
      MultipleDrivers
    } derive(Eq, 
    Debug    )

    PathStatus::label

    source
    fn PathStatus::label(self : PathStatus) -> String

    ReachabilityResult

    source
    pub(all) struct ReachabilityResult {
      status : PathStatus
      net_name : String
      source : String
      reachable : Array[ReachableNode]
      unreachable_nodes : Array[String]
      farthest : ReachableNode?
    } derive(
    Debug    )

    ReachableNode

    source
    pub(all) struct ReachableNode {
      node_id : Int
      node_name : String
      resistance : Double
      edge_count : Int
    } derive(
    Debug    )

    SearchState

    source
    type SearchState derive(
    Debug    )

    critical_resistance_path

    source
    fn critical_resistance_path(net : 
    Net    ) -> PathResult

    Finds the minimum-resistance route from the sole driver to the electrically farthest reachable local node.

    diameter_path

    source

    minimum_hop_path

    source
    fn minimum_hop_path(net : 
    Net    , source : String, target : String) -> PathResult

    Finds the path with the fewest resistor edges using breadth-first search.

    minimum_resistance_path

    source
    fn minimum_resistance_path(net : 
    Net    , source : String, target : String) -> PathResult

    Finds the lowest-resistance path using Dijkstra's algorithm.

    Resistance values must be finite and non-negative. Ties are resolved by preferring fewer edges, then by the stable SPEF resistor order.

    resistance_matrix

    source

    Computes unordered all-pairs minimum-resistance distances for local nodes. This uses one Dijkstra search per source and is intended for inspection and moderate-sized extracted nets rather than full-chip timing signoff.

    resistance_reachability

    source
    fn resistance_reachability(net : 
    Net    , source : String) -> ReachabilityResult

    Returns minimum resistance and hop count from one source to every local node. Results are sorted by resistance and then by node name.

    Source Files

    Powered by MoonBit

    Site sourceReport issuePackagesBuild queueSkillsStatistics

    © 2026 mooncakes.io