Observed arrival · 2026-10-03
gograph makes graph algorithms show their work
An interactive showcase for stepping through graph algorithms implemented in the gograph Go library.
○Open
⊠Login
$Paid
†Ads
✦Pretty
●Pro
◎Niche
◉Human
⚑Risk
ƒJS
- For
- Go developers and graph algorithm learners
- Worth noticing
- Its algorithm list includes both dependency impact analysis and randomized walks, alongside shortest-path and connectivity methods.
Field notes
The catalog ranges from breadth-first and depth-first traversal to Floyd-Warshall, strongly connected components, maximal cliques, and randomized k-cut. Dependency examples connect graph operations to build jobs, course prerequisites, and spreadsheet recalculation. The page links to the code and names the Go module installation command.
Observed signals
Read the marks
Editorial observations of this landing page, not a rating.
○OpenPublic substance visible
✦PrettyNotable craft visible
●ProPolished or operationally mature
◎NicheUnusually specific use
One card from the complete issue