[ccan] [PATCH 0/5] aga,agar: Dijkstra's algorithm

[David Gibson]

After many diversions, I'm finally ready to paint this bikeshed, with
a brush of finest yak hair.

This series implements Dijkstra's algorithm for single-source
shortest-path in the aga and agar modules.

David Gibson (5):
  aga,agar: Add edge costs
  aga,agar: Dijkstra's algorithm
  aga,agar: Non-equal edge costs for parallel test graph
  aga,agar: New shortcut1 sample graph and testcases based on it
  aga,agar: New shortcut2 sample graph and testcases based on it

 ccan/aga/_info                 |   2 +
 ccan/aga/aga.c                 |   1 +
 ccan/aga/aga.h                 |  94 ++++++++++++++
 ccan/aga/dijkstra.c            | 131 ++++++++++++++++++++
 ccan/aga/test/api-adjacency.c  |  12 +-
 ccan/aga/test/api-bfs.c        |   2 +-
 ccan/aga/test/api-dfs.c        |   2 +-
 ccan/aga/test/api-dijkstra.c   | 266 ++++++++++++++++++++++++++++++++++++++++
 ccan/aga/test/parallel.c       |   7 +-
 ccan/aga/test/shortcut1.c      |  93 ++++++++++++++
 ccan/aga/test/shortcut2.c      |  94 ++++++++++++++
 ccan/aga/test/simple-graph.h   |  44 ++++++-
 ccan/agar/agar.c               |  61 ++++++++++
 ccan/agar/agar.h               |  13 ++
 ccan/agar/test/api-adjacency.c |  12 +-
 ccan/agar/test/api-bfs.c       |   2 +-
 ccan/agar/test/api-dfs.c       |   2 +-
 ccan/agar/test/api-dijkstra.c  | 271 +++++++++++++++++++++++++++++++++++++++++
 ccan/agar/test/parallel.c      |  10 +-
 ccan/agar/test/shortcut1.c     |  86 +++++++++++++
 ccan/agar/test/shortcut2.c     |  87 +++++++++++++
 ccan/agar/test/simple-graphr.h |  45 ++++++-
 22 files changed, 1325 insertions(+), 12 deletions(-)
 create mode 100644 ccan/aga/dijkstra.c
 create mode 100644 ccan/aga/test/api-dijkstra.c
 create mode 100644 ccan/aga/test/shortcut1.c
 create mode 100644 ccan/aga/test/shortcut2.c
 create mode 100644 ccan/agar/test/api-dijkstra.c
 create mode 100644 ccan/agar/test/shortcut1.c
 create mode 100644 ccan/agar/test/shortcut2.c

-- 
2.5.0