graph
btree
Our great sponsors
| graph | btree | |
|---|---|---|
| 33 | 5 | |
| 1,709 | 3,757 | |
| - | 1.0% | |
| 6.4 | 0.0 | |
| 10 days ago | 5 months ago | |
| Go | Go | |
| Apache License 2.0 | Apache License 2.0 |
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
-
Shaving 40% Off Google’s B-Tree Implementation with Go Generics
This may be confusing to those familiar with Google's libraries. The baseline is the Go BTree, which I personally never heard of until just now, not the C++ absl::btree_set. The benchmarks aren't directly comparable, but the C++ version also comes with good microbenchmark coverage.
https://github.com/google/btree
https://github.com/abseil/abseil-cpp/blob/master/absl/contai...
-
I created an in-memory SQL database called MemSQL as a learning project
You might be interested in https://github.com/google/btree and having a default tree based around a PK. A simpler tree like an AVL or Red-Black Tree would let you do efficient range lookups for the PK as well.
- Any major projects using generics?
-
AVL balanced generic binary trees in Go
Go has generics now, and the API surface of the most popular btree implementations llrb and google don't quite match what I like from an iteration and sorting perspective. AVL has a pretty straightforward balancing model, and it turns out to be pretty performant for what I wind up doing a lot of the time.
- What are some secrets for solving tree problems during code interviews
What are some alternatives?
scan - Scan provides the ability to to scan sql rows directly to any defined structure.
hooks - Simple, type-safe hook system to enable easier modularization of your Go code.
be - The Go test helper for minimalists
concurrent-map - a thread-safe concurrent map for go
warg - Declarative and Intuitive Command Line Apps with Go
go-events - :mega: Pure nodejs EventEmmiter for the Go Programming Language.
NetworkX - Network Analysis in Python
verify - Extensible, type-safe, fluent assertion Go library.
bob - SQL query builder and ORM/Factory generator for Go with support for PostgreSQL, MySQL and SQLite
surf - CLI Text Search across your infrastructure platforms, Universal Ctrl+F for infra
JGraphT - Master repository for the JGraphT project
test - A modern generic testing assertions library for Go