{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:nuget/morestructures","name":"morestructures","description":"MoreStructures is a library of classical algorithms and data structures, written 100% in (safe, managed) C# 10, for .NET 6 and above.\nData structures - Stacks, Queues, Priority Queues, Disjoint Sets, Trees, Graphs, Suffix Trees, Suffix Tries.\nAlgorithms - Strings sorting and matching. Lists searching and sorting. Trees augmentation and visit. \nGraphs: visits, minimum spanning tree, shortest distance, shortest path, topological sorting, strongly connected components. \nSuffix Trees and Tries construction and matching.","version":"0.0.7","softwareVersion":"0.0.7","license":"https://spdx.org/licenses/MIT","codeRepository":"https://github.com/antonioaversa/MoreStructures","issueTracker":"https://github.com/antonioaversa/MoreStructures/issues","url":"https://github.com/antonioaversa/MoreStructures","keywords":["algorithms","data-structures","structures","data","lists","trees","graphs","stacks","queues","priority","heaps","binary","binomial","Fibonacci","disjoint","sets","quick","union","find","suffix","tries","sorting","matching","searching","DFS","BFS","Ukkonen","Dijkstra","Bellman-Ford","Kasai","Burrows-Wheeler","Transform","array","LCP","Knuth-Morris-Pratt","Prim","Kruskal","shortest","path","A*"],"programmingLanguage":{"@type":"ComputerLanguage","name":"C#"},"maintainer":[{"@type":"Person","name":"differenziale"}],"author":[{"@type":"Person","name":"differenziale"}],"copyrightHolder":[{"@type":"Person","name":"differenziale"}],"dateCreated":"1900-01-01","dateModified":"2022-10-02","datePublished":"2022-10-02","copyrightYear":1900,"downloadUrl":"https://api.nuget.org/v3-flatcontainer/morestructures/0.0.7/morestructures.0.0.7.nupkg","applicationCategory":"nuget","runtimePlatform":"nuget","developmentStatus":"active","sameAs":["https://www.nuget.org/packages/morestructures/"],"https://www.w3.org/ns/activitystreams#likes":5}