Guillaume Dalle comments

Results 1600 comments of


                                            Guillaume Dalle

Custom priority queues for Dijkstra & Co

For unweighted graphs, isn't Dijkstra just BFS?

Custom priority queues for Dijkstra & Co

For which, by the way, an iterator would be nice (see #106)

Canonical output when printing a graph

I like the last one best, and it is closest to the actual adjacency list storage

Working with edge indices

Indeed for `SimpleGraph`s it is reasonably easy to do. My only fear is that if we add this to the API and start using it elsewhere (for instance in algorithms),...

Working with edge indices

But sometimes you do need that ordering. For instance, in my current research, I use edge weights that are computed by a neural network. That means they are naturally given...

IsMutable trait

This is better than #80 so I'm closing that one.

[Port] A proposal of an all_simple_paths function implementation

Related to #106

[Port] A proposal of an all_simple_paths function implementation

> What is the current status of this PR? I.e. who's turn is is to review/write code? I was not aware we had defined turns, I thought it was more...

[Port] A proposal of an all_simple_paths function implementation

> Good look with your manuscript,, I will try to avoid pinging you any further then for now. On the contrary, do ping me when you need a quick opinion,...

Implementation for planar maximally filtered graph

Hi @josephcbradley and thanks for the suggestion! Would you be willing to submit a PR with a first implementation draft?