Aardvark.Base


ShortestPath<'T>

Constructors

ConstructorDescription
new(nodes, edges, getCostFunc)
Signature: (nodes:List<'T> * edges:List<Pair<int>> * getCostFunc:Func<'T,'T,float32>) -> unit
new(nodes, neighbors, getCostFunc)
Signature: (nodes:'T [] * neighbors:List<int> [] * getCostFunc:Func<'T,'T,float32>) -> unit

Instance members

Instance memberDescription
CalculateShortestPaths(seed)
Signature: seed:'T -> unit
Modifiers: abstract
CalculateShortestPathsByIndex(index)
Signature: index:int -> unit
Modifiers: abstract
Cancel()
Signature: unit -> unit
Modifiers: abstract
GetMinimalPath(end)
Signature: end:'T -> List<'T>
Modifiers: abstract
GetMinimalPathByIndex(endIndex)
Signature: endIndex:int -> List<'T>
Modifiers: abstract
Fork me on GitHub