https://github.com/twmb/go-dgraph

Provides the strong components (Tarjan's) algorithm for determining dependency ordering and cycles with slices.
https://github.com/twmb/go-dgraph

Last synced: about 1 year ago
JSON representation

Provides the strong components (Tarjan's) algorithm for determining dependency ordering and cycles with slices.

• Host: GitHub
• URL: https://github.com/twmb/go-dgraph
• Owner: twmb
• License: mit
• Created: 2019-08-17T07:36:16.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2019-08-17T08:18:59.000Z (almost 7 years ago)
• Last Synced: 2025-02-01T03:43:15.107Z (over 1 year ago)
• Language: Go
• Homepage:
• Size: 7.81 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
go-dgraph

=========

Package `dgraph` provides a very simple directed graph with the sole purpose of

returning nodes and cycles in dependency order with the strongly connected

components (Tarjan's) algorithm.

The StrongComponents returns graph components in dependency order. If the graph

has no cycles, each component will have a single element. Otherwise, all nodes

in a cycle are grouped into one "strong" component.

Documentation

-------------

[![GoDoc](https://godoc.org/github.com/twmb/go-dgraph?status.svg)](https://godoc.org/github.com/twmb/go-dgraph)