#1 Zap
Package zap provides fast, structured, leveled logging.
github.com/aio-arch/graphlib
graphlib
Topological sort lib,Sorting and pruning of DAG graphs.
Decision Signals
Health score 58/100, confidence 80/100.
Install
go get github.com/aio-arch/graphlib
Package Data
updated May 28, 2026| Latest version | v1.0.2 |
| Imported by | 1 packages |
| Stars | 0 |
| Forks | 0 |
| Last activity | 9 months ago |
| Latest release | Unknown |
| License | Unknown |
| Known vuln records | 0 |
API Surface
13 symbols| Symbol | Kind | Synopsis |
|---|---|---|
| ErrCycle | Type | type ErrCycle struct{} |
| ErrCycle.Error | Method | func (e *ErrCycle[V]) Error() string |
| ErrUnknownNode | Type | type ErrUnknownNode struct{} |
| ErrUnknownNode.Error | Method | func (e *ErrUnknownNode[V]) Error() string |
| Graph | Type | type Graph struct{} |
| Graph.Add | Method | func (g *Graph[V]) Add(node V, predecessors ...V) |
| Graph.AddEdge | Method | func (g *Graph[V]) AddEdge(from, to V) |
| Graph.AddNode | Method | func (g *Graph[V]) AddNode(node V) *nodeInfo[V] |
| Graph.IsAcyclic | Method | func (g *Graph[V]) IsAcyclic() ([]V, bool) |
| Graph.NodeSortSet | Method | func (g *Graph[V]) NodeSortSet() []V |
| NewGraph | Function | func NewGraph[V comparable]() *Graph[V] |
| TopologicalPrune | Function | func TopologicalPrune[V comparable](digraph *Graph[V], nodes []V) (*Graph[V], error) |
Similar Packages
Go Logging Libraries#2 phuslu/log
Fastest structured logging
#3 Zerolog
Package zerolog provides a lightweight logging library dedicated to JSON logging.
#4 Logrus
Package logrus is a structured logger for Go, completely API compatible with the standard library logger.