Simon Schölly
Simon Schölly
I made a PR with a suggestion for such a `FrozenVector`: #317
It also look to me, as if those changes might make the algorithm perform slower than before, but I only checked this single case: before: ```julia julia> @btime dijkstra_shortest_paths($(grid([50, 50])),...
> An update. I've removed Meshes and Combinatorics so far, with only GeometryBasics left to do. At the same time, most of the important code has been rewritten for those...
👍 for a problem bases approach instead of a solution based one. In some cases it might also make sense to use some kind of heuristic in such a function...
Although maybe shortest path with A* is not the best example, as in that case we need more parameters than for dijkstra.
I don't think this should be tagged as a v2.0 issue, there is no reason not to use `GenericGraph` right now.
Hey, thanks for this contribution, I think planarity is indeed something we could use. It might take a bit longer to completely review this PR, as these planarity algorithms are...
Somehow github send me an email, that I am mentioned in this PR - but I can't find that comment anymore. It it important that this gets merged very soon?...
Great! have you also thought about some functions for the directed case?
> By the way I called it 'regular tree' because of the analogy with regular graphs but that might not be too accurate because: > > 1. A regular tree...