Open JuliusHendrix opened 1 year ago
Change the statsmanager to get nodes & values instead of just values to get more varied sorting
The distance calculation with the edge weight makes a 'negative association' a shorter path. Maybe have two variants, one to find order by "positive association" and one by "negative association". Or does taking into account the association even make sense?
Add Dijkstra distance calculation (weighted & unweighted) to the graph statistics manager.
A* is faster, but what is the heurtistic function?