Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Algo.kruskal_sorted.Points definitions

Definition
Algo_kruskal_sorted_Points

by lunjia · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

Definitions and required structural lemmas from Algo.kruskal_sorted.Points. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.

<!-- algo2lean-provenance-v0.1.4 -->

Algo2Lean provenance and reproduction. These definitions target Algo2Lean v0.1.4, using the compiler source at public commit 0f79d5e4242e6477531c9ee4410409f5b1c92f76, and Lean 4.33.1. The versioned compiler location is Algo2Lean v0.1.4. Compile all supplied .algo files and imports to reproduce the raw generated definitions. Release publication and exact website parity require their separately recorded checks; this metadata alone does not assert them. Prove2Me imports and declaration packaging are mechanically adapted, with original hashes, compiler-reported source ranges, and adaptations recorded in transplant provenance. Exact reproduction does not prove the compiler correct.

Definition code
import Definitions.Def_Algo_kruskal_sorted_Generated

set_option autoImplicit true
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true


-- Generated by Algo2Lean 0.1.4 https://github.com/lunjiah/algo2lean

namespace Algo.«kruskal_sorted»

open _root_.Algo2LeanGenerated Algo2LeanGenerated

-- Named locations are independent of the compiled module body.

-- Before source line 15, column 5; location only, not reachability.
def kruskal_sorted.At.scan : Configuration → Prop
  | .active _ (.fn_kruskal_sorted 4 _) _ => True
  | _ => False
-- Before source line 23, column 9; location only, not reachability.
def kruskal_sorted.At.test : Configuration → Prop
  | .active _ (.fn_kruskal_sorted 13 _) _ => True
  | _ => False
-- Before source line 25, column 13; location only, not reachability.
def kruskal_sorted.At.select : Configuration → Prop
  | .active _ (.fn_kruskal_sorted 11 _) _ => True
  | _ => False
-- Before source line 27, column 13; location only, not reachability.
def kruskal_sorted.At.join : Configuration → Prop
  | .active _ (.fn_kruskal_sorted 10 _) _ => True
  | _ => False
def kruskal_sorted.Local.size : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v0 else none
  | _ => none
def kruskal_sorted.Local.sources : Configuration → Option SeqRef
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v1 else none
  | _ => none
def kruskal_sorted.Element.sources (state : Configuration) (index : Int) : Option Int :=
  (_root_.Algo.«kruskal_sorted».kruskal_sorted.Local.sources state).map (fun ref => state.heap.read ref index)
def kruskal_sorted.Local.targets : Configuration → Option SeqRef
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v2 else none
  | _ => none
def kruskal_sorted.Element.targets (state : Configuration) (index : Int) : Option Int :=
  (_root_.Algo.«kruskal_sorted».kruskal_sorted.Local.targets state).map (fun ref => state.heap.read ref index)
def kruskal_sorted.Local.weights : Configuration → Option SeqRef
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v3 else none
  | _ => none
def kruskal_sorted.Element.weights (state : Configuration) (index : Int) : Option Int :=
  (_root_.Algo.«kruskal_sorted».kruskal_sorted.Local.weights state).map (fun ref => state.heap.read ref index)
def kruskal_sorted.Local.count : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v4 else none
  | _ => none
def kruskal_sorted.Local.order : Configuration → Option SeqRef
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v5 else none
  | _ => none
def kruskal_sorted.Element.order (state : Configuration) (index : Int) : Option Int :=
  (_root_.Algo.«kruskal_sorted».kruskal_sorted.Local.order state).map (fun ref => state.heap.read ref index)
def kruskal_sorted.Local.chosen : Configuration → Option SeqRef
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v6 else none
  | _ => none
def kruskal_sorted.Element.chosen (state : Configuration) (index : Int) : Option Int :=
  (_root_.Algo.«kruskal_sorted».kruskal_sorted.Local.chosen state).map (fun ref => state.heap.read ref index)
def kruskal_sorted.Local.sets : Configuration → Option Ref__a2l_import_0_UnionFind
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v7 else none
  | _ => none
def kruskal_sorted.Local.index : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 4 ∨ pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v8 else none
  | _ => none
def kruskal_sorted.Local.edge : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v9 else none
  | _ => none
def kruskal_sorted.Local.a : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v10 else none
  | _ => none
def kruskal_sorted.Local.b : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v11 else none
  | _ => none
def kruskal_sorted.Local.left : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v12 else none
  | _ => none
def kruskal_sorted.Local.right : Configuration → Option Int
  | .active _ (.fn_kruskal_sorted pc s) _ => if pc = 10 ∨ pc = 11 ∨ pc = 13 then some s.v13 else none
  | _ => none

end Algo.«kruskal_sorted»
Source
https://github.com/lunjiah/algo2lean/blob/9755b41d188977ae1aafdaf9eccdac0b0edb0420/examples/kruskal/kruskal_sorted.algo

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me