README
¶
Netkit
Go (generic) graph algorithms and extensible libraries focused on clarity and performance.
- Go 1.21+
- Module:
github.com/elecbug/netkit
Install
go get github.com/elecbug/netkit@latest
Packages
Graph
graph: Library for creating and building unweighted graphs.standard_graph: Library for generating standard graphs like Erdos-Reyni graph.algorithm: Library containing various graph algorithms.
P2P
p2p: Library that integrates with graph libraries to form networks and enable P2P broadcast experiments.
Extensible
bimap: Bidirectional map with O(1) lookups key->value and value->key.
Development
- Run tests
go test ./...
License
MIT © 2025 elecbug. See LICENSE.
Credits
This project reimplements common network algorithms in Go with results validated against NetworkX. NetworkX is © the NetworkX Developers and distributed under the BSD 3-Clause License.
Documentation
¶
Overview ¶
Package netkit provides common types and utilities used across this repository.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
Package bimap implements a bidirectional map with constant-time lookups from key to value and value to key.
|
Package bimap implements a bidirectional map with constant-time lookups from key to value and value to key. |
|
Package graph provides a simple adjacency map graph for network-graph.
|
Package graph provides a simple adjacency map graph for network-graph. |
|
algorithm
Package algorithm provides graph algorithms for network analysis.
|
Package algorithm provides graph algorithms for network analysis. |
|
standard_graph
Package standard_graph provides a standard implementation of a graph data structure.
|
Package standard_graph provides a standard implementation of a graph data structure. |
|
Package p2p provides types and interfaces for a peer-to-peer networking simulation.
|
Package p2p provides types and interfaces for a peer-to-peer networking simulation. |
Click to show internal directories.
Click to hide internal directories.