{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/graphs","name":"graphs","description":"A \"not-very-Haskelly\" API for calculating traversals of graphs that may be too large to fit into memory.\nThe algorithms included are inspired by the visitor concept of the\nBoost Graph Library.\n\nHere 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,\n\ncreate an adjacency list where the vertices are labeled with integers.","version":"0.7.3","softwareVersion":"0.7.3","license":"https://spdx.org/licenses/BSD-3-Clause","codeRepository":"https://github.com/ekmett/graphs","issueTracker":"https://github.com/ekmett/graphs/issues","url":"http://github.com/ekmett/graphs","keywords":["algorithms","bsd3","data-structures","graphs","library","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"ryanglscott"},{"@type":"Person","name":"EdwardKmett"}],"author":[{"@type":"Person","name":"ryanglscott"},{"@type":"Person","name":"EdwardKmett"}],"copyrightHolder":[{"@type":"Person","name":"ryanglscott"},{"@type":"Person","name":"EdwardKmett"}],"dateCreated":"2011-01-21","dateModified":"2025-03-03","datePublished":"2025-03-03","copyrightYear":2011,"downloadUrl":"https://hackage.haskell.org/package/graphs-0.7.3/graphs-0.7.3.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/graphs"],"https://www.w3.org/ns/activitystreams#likes":39,"https://forgefed.org/ns#forks":7}