Algo.dijkstra.dijkstra_fibonacci.Analysis definitions
DefinitionAlgo_dijkstra_dijkstra_fibonacci_AnalysisDefinitions and required structural lemmas from Algo.dijkstra.dijkstra_fibonacci.Analysis. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.
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.
import Definitions.Def_Algo_dijkstra_dijkstra_fibonacci_Generated
import Definitions.Def_Algo_dijkstra_dijkstra_fibonacci_Facts
import Definitions.Def_Algo_dijkstra_dijkstra_Analysis
import Definitions.Def_Algo_dijkstra_support_fibonacci_queue_Analysis
set_option autoImplicit true
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true
/-! The concrete wrapper constructs a queue and client arrays, then applies the
unchanged generic Dijkstra theorem and the independent queue contract. -/
namespace FibonacciDijkstraAnalysis
open Algo2LeanCore Algo2LeanGenerated Algo2Lean.Dijkstra
open Algo.graph.Algo2LeanGenerated
open Algo.dijkstra.dijkstra_fibonacci
open ComposableDijkstraAnalysis
/-- Generated binding theorems connect independently compiled source methods. -/
def bridge : FibonacciQueueAnalysis.Bridge FibonacciHeap_as_PriorityQueue where
valid := by intro heap ref; simp [FibonacciHeap_as_PriorityQueue]
is_empty := FibonacciHeap_as_PriorityQueue_summary_is_empty
update := FibonacciHeap_as_PriorityQueue_summary_push_or_decrease
extract := FibonacciHeap_as_PriorityQueue_summary_pop_min
/-- Every explicit backend and client counter occurs once in this metric. -/
def clockWork (costs : Clocks) : Nat :=
Clocks.weighted FibonacciQueueAnalysis.metric costs + costs "queue_updates" + costs "queue_pops" +
costs "queue_empty_checks" + costs "edges" + costs "improvements" + costs "settlements"
def runtimeBound (size : Int) (adjacency : Adjacency) : Nat :=
(20 + 3) * (edgeBudget adjacency (vertexRange size) + 1) + ((12 * (2 * size.toNat.log2 + 2)) + 3) * size.toNat
-- Main result: Correctness and running time
end FibonacciDijkstraAnalysis