golang-github-yourbasic-graph 1.0.5-3 source package in Ubuntu
Changelog
golang-github-yourbasic-graph (1.0.5-3) unstable; urgency=low
[ Debian Janitor ]
* Bump debhelper from old 11 to 12.
* Set debhelper-compat version in Build-Depends.
* Set upstream metadata fields: Bug-Database, Bug-Submit, Repository,
Repository-Browse.
* Update standards version to 4.5.0, no changes needed.
* Apply multi-arch hints.
+ golang-github-yourbasic-graph-dev: Add Multi-Arch: foreign.
-- Jelmer Vernooij <email address hidden> Tue, 29 Nov 2022 19:24:17 +0000
Upload details
- Uploaded by:
- Debian Go Packaging Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Go Packaging Team
- Architectures:
- all
- Section:
- golang
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc | |
| Noble | release | universe | misc | |
| Mantic | release | universe | misc | |
| Lunar | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| golang-github-yourbasic-graph_1.0.5-3.dsc | 2.2 KiB | 12e2d65127516be3f4f7d26716028b22ec7c9185bae0cf2e30ef00d2477169b2 |
| golang-github-yourbasic-graph_1.0.5.orig.tar.xz | 45.1 KiB | 464187f777b9f9d1b3c509e85d4abfe3e8ecdc86b164e83ebaa6f5f880a71fdf |
| golang-github-yourbasic-graph_1.0.5-3.debian.tar.xz | 2.6 KiB | ce78aba20c509a4491a28cd8df42b4a32cbe44f8a50dbaad48a2e77c98692bfb |
Available diffs
- diff from 1.0.5-2 to 1.0.5-3 (1.2 KiB)
No changes file available.
Binary packages built by this source
- golang-github-yourbasic-graph-dev: graph algorithms and data structures
This package contains a Golang library of basic graph algorithms
and topological ordering.
.
This library offers efficient and well-tested algorithms for
- breadth-first and depth-first search,
- topological ordering,
- strongly and weakly connected components,
- bipartion,
- shortest paths,
- maximum flow,
- Euler walks,
- and minimum spanning trees.
The algorithms can be applied to any graph data structure implementing
the two Iterator methods: Order, which returns the number of vertices,
and Visit, which iterates over the neighbors of a vertex.
