graphs
A "not-very-Haskelly" API for calculating traversals of graphs that may be too large to fit into memory. The algorithms included are inspired by the visitor concept of the Boost Graph Library. Here is a very simple example of how we might execute a depth-first-search. In this case the visitor simply collects the edges and vertices in the order that the corresponding functions get called. After the necessary imports, create an adjacency list where the vertices are labeled with integers.
Ecosystem
hackage.haskell.org
hackage.haskell.org
Latest Release
about 1 year ago
0.7.3
about 1 year ago
Versions
20
20
Downloads
15,453 total
15,453 total
Dependent Repos
262
262
Links
| Registry | hackage.haskell.org |
| Source | Repository |
| Homepage | Homepage |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:hackage/graphs
spec |
| License | BSD-3-Clause |
| First Release | about 15 years ago |
| Last Synced | 15 days ago |
Repository
| Stars | 39 on GitHub |
| Forks | 7 on GitHub |
| Commits | 94 |
| Committers | 5 |
| Avg per Author | 18.8 |
| DDS | 0.457 |
Rankings on hackage.haskell.org
Dependent repos
Top 1.6%