https://github.com/ekmett/graphs
Last synced: about 2 months ago
Repository metadata:
a monadic graph library
- Host: GitHub
- URL: https://github.com/ekmett/graphs
- Owner: ekmett
- License: other
- Created: 2011-01-20T10:27:23.000Z (almost 14 years ago)
- Default Branch: master
- Last Pushed: 2023-10-01T13:33:33.000Z (about 1 year ago)
- Last Synced: 2024-09-01T00:36:47.088Z (4 months ago)
- Language: Haskell
- Homepage:
- Size: 113 KB
- Stars: 39
- Watchers: 9
- Forks: 7
- Open Issues: 0
-
Metadata Files:
- Readme: README.markdown
- Changelog: CHANGELOG.markdown
- License: LICENSE
Owner metadata:
- Name: Edward Kmett
- Login: ekmett
- Email:
- Kind: user
- Description: I write a lot of Haskell.
- Website: http://comonad.com
- Location: Farmington Hills, MI
- Twitter: kmett
- Company: Groq
- Icon url: https://avatars.githubusercontent.com/u/304657?v=4
- Repositories: 298
- Last Synced at: 2023-04-10T02:32:00.294Z
- Profile URL: https://github.com/ekmett
- Sponsor URL:
Committers metadata
Last synced: about 2 months ago
Total Commits: 96
Total Committers: 5
Avg Commits per committer: 19.2
Development Distribution Score (DDS): 0.469
Commits in past year: 0
Committers in past year: 0
Avg Commits per committer in past year: 0.0
Development Distribution Score (DDS) in past year: 0.0
| Name | Commits | |
|---|---|---|
| Edward Kmett | e****t@g****m | 51 |
| Ryan Scott | r****t@g****m | 31 |
| Jeffrey Rosenbluth | j****h@g****m | 10 |
| Harendra Kumar | h****r@g****m | 2 |
| Sergiu Ivanov | u****b@g****m | 2 |
Issue and Pull Request metadata
Last synced: about 2 months ago
Package metadata
- Total packages: 1
-
Total downloads:
- hackage: 14,908 total
- Total dependent packages: 0
- Total dependent repositories: 262
- Total versions: 19
- Total maintainers: 2
hackage: 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.
- Homepage: http://github.com/ekmett/graphs
- Licenses: BSD-3-Clause
- Latest release: 0.7.2 (published over 2 years ago)
- Last Synced: 2024-11-11T03:07:39.902Z (about 2 months ago)
- Versions: 19
- Dependent Packages: 0
- Dependent Repositories: 262
- Downloads: 14,908 Total
-
Rankings:
- Dependent repos count: 1.582%
- Downloads: 10.167%
- Average: 11.337%
- Stargazers count: 12.585%
- Forks count: 13.077%
- Dependent packages count: 19.271%
- Maintainers (2)
Dependencies
- actions/cache/restore v3 composite
- actions/cache/save v3 composite
- actions/checkout v3 composite
- array >=0.3 && <0.7
- base ==4.*
- containers >=0.3 && <0.8
- semigroups >=0.16 && <1
- transformers >=0.2.2 && <0.7
- transformers-compat >=0.3 && <1
- void >=0.5.5.1 && <1