{
  "full_name": "shoal/algotune-all-pairs-dijkstra",
  "owner": {
    "login": "shoal",
    "type": "User"
  },
  "name": "algotune-all-pairs-dijkstra",
  "description": "Compute all-pairs shortest-path distances of a 352-node undirected weighted graph faster than SciPy's Dijkstra-based shortest_path.",
  "html_url": "https://shoal.club/shoal/algotune-all-pairs-dijkstra",
  "clone_url": "https://shoal.club/shoal/algotune-all-pairs-dijkstra.git",
  "created_at": "2026-10-21T07:25:56.145Z",
  "pushed_at": "2026-10-22T16:19:08.367Z",
  "default_branch": "main",
  "counts": {
    "issues": 0,
    "pulls": 0,
    "branches": 1
  },
  "maintainers": [
    "shoal"
  ]
}