Skip to main content

New answers tagged

3 votes

Dijkstra's algorithm for non-uniform undirected hypergraphs

I'll just focus on the code, as math and related subjects are generally better answered by anybody but me. In general the code looks quite good though, so I'll start with that. The good Guard ...
Maarten Bodewes's user avatar
4 votes
Accepted

Dijkstra's algorithm for non-uniform undirected hypergraphs

It doesn't seem like a hyperedge cares about the order in which its nodes are connected or vice versa, and it doesn't seem like the same node should be able to appear multiple times on the same ...
Sara J's user avatar
  • 4,221

Top 50 recent answers are included