@startuml
skinparam nodesep 40
skinparam ranksep 40

interface MinimumPriorityQueue<T> {
  +insert(id: T, priority: number): void
  +extract(): Nullable<WithPriority<T>>
}

class BinaryMinimumPriorityQueue<T> {
  -ids: T[]
  -values: number[]
  -length: number
}
BinaryMinimumPriorityQueue .up.|> MinimumPriorityQueue

interface MinimumSpanningTreeCalculator{
  +calculate(adjacencyMatrix: number[][]): {\n  previous: Nullable<number>[],\n  totalCost: number\n}
}

class Prim {
}
Prim .up.|> MinimumSpanningTreeCalculator
Prim .right.> MinimumPriorityQueue 

interface ShortestPathCalculator {
  +calculate(\n  heightMap: HeightMap,\n  source: Position2D,\n  exploredMap: ExploredMap\n): {\n  previousMap: PreviousMap,\n  distanceMap: DistanceMap\n}
}


class UniformCostSearch {
}
UniformCostSearch .up.|> ShortestPathCalculator 
UniformCostSearch .left.> MinimumPriorityQueue

abstract class BaseAgent {
}
BaseAgent ..> ShortestPathCalculator 
BaseAgent ..> MinimumSpanningTreeCalculator

abstract class BaseSimulation {
}
BaseSimulation ..> ShortestPathCalculator 
BaseSimulation ..> MinimumSpanningTreeCalculator
@enduml