graph
btree
| graph | btree | |
|---|---|---|
| 33 | 3 | |
| 1,719 | 18 | |
| - | - | |
| 5.3 | 0.0 | |
| 6 days ago | over 1 year 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
btree
-
Do you use generics?
Generally when I feel like revisiting some CS staples and working out how to implement them idiomatically with generics. https://github.com/VictorLowther/btree is an example of this.
-
Immutable copy-on-write generic binary trees in Go
So, a couple of weeks ago, I wrote this. It does its job, and is pretty performant for what it is. However, I got to wondering how to make it work in an environment with many concurrent readers and a single writer. An rwmutex was too easy, so I decided to go ahead and make all tree modification copy-on-write instead. Turned out that it gets pretty acceptable performance with a couple of strategic performance optimizations.
- AVL balanced generic binary trees in Go
What are some alternatives?
btree - BTree provides a simple, ordered, in-memory data structure for Go programs.
scan - Scan provides the ability to to scan sql rows directly to any defined structure.
GoLLRB - A Left-Leaning Red-Black (LLRB) implementation of balanced binary search trees for Google Go
be - The Go test helper for minimalists
go-sql-builder-benchmarks - Benchmarking Golang SQL query builders
bob - SQL query builder and ORM/Factory generator for Go with support for PostgreSQL, MySQL and SQLite
ibtree - Immutable generic balanced binary trees
NetworkX - Network Analysis in Python
sage - Trie data structure for storing and retrieving HTTP route values. Used for building Go HTTP router packages.
warg - Declarative and Intuitive Command Line Apps with Go
Mantis - Sphire Mantis is a broadly featured Go helper library with standalone packages