graph
gods
Our great sponsors
| graph | gods | |
|---|---|---|
| 33 | 9 | |
| 1,709 | 15,385 | |
| - | - | |
| 6.4 | 3.1 | |
| 12 days ago | 8 days ago | |
| Go | Go | |
| Apache License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
graph
- Create, analyze, and modify graphs and networks in Go
- Show HN: Creating, Modifying, Analyzing, and Visualizing Graphs/Networks in Go
-
Digger is trending on GitHub in Golang
Awesome project, and nice to see that it seems to use my graph library (graph) for managing dependencies!
- graph: A library for creating generic graph data structures and modifying, analyzing, and visualizing them
-
Dagger V3 Release (generic/concurrency-safe Directed Acyclic Graph)
Why should I use yours over this?
- graph v0.20 adds support for adding vertices and edges from other graphs, retrieving and updating edges, computing spanning trees, and more
-
GitHub doesn't show the latest commit and rejects any pushes
Any ideas how I could've ended up with this and how I could resolve this? The repository is github.com/dominikbraun/graph.
- graph v0.16 supports integrating any storage backend for storing graph data structures
- Visualize complex networks and structures in Go
gods
-
How do you go about the lack of built in data structure like stack, queue for LeetCode
for len(stack) > 0 { n := len(stack) - 1 // Top element fmt.Print(stack[n]) stack = stack[:n] // Pop } ``` Another solution would be to import a package like https://github.com/emirpasic/gods
-
Go Structures - Custom made generic data structures for Golang
What is the goal of this project? A learning exercise? There are many fairly matured solutions already available like https://github.com/emirpasic/gods. It also does not look implemented effectively. For example Stack uses for its push/pop operations costly List methods.
- Golang & Data Structures
-
Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)
Doesn't say why it's here instead of trying to get into GoDS or something else.
-
Are there implementations of data structures with generics? Are they needed?
I've found GoDS (https://github.com/emirpasic/gods) but it is not using generics, it's using "interface{}" as a type for everything.
- Gods Go Data Structures
- Experimental generic implementations of various data structures (map, b-tree, AVL tree, rope, and more)
-
Have you used a trie in Go?
You may want to try this implementation
What are some alternatives?
be - The Go test helper for minimalists
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
scan - Scan provides the ability to to scan sql rows directly to any defined structure.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
btree - BTree provides a simple, ordered, in-memory data structure for Go programs.
gomarkdoc - Generate markdown documentation for Go (golang) code
warg - Declarative and Intuitive Command Line Apps with Go
gota - Gota: DataFrames and data wrangling in Go (Golang)
NetworkX - Network Analysis in Python
levenshtein - Go implementation to calculate Levenshtein Distance.
bob - SQL query builder and ORM/Factory generator for Go with support for PostgreSQL, MySQL and SQLite
encoding - Integer Compression Libraries for Go