topological-sorting

command
v0.0.0-...-aed8115 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Apr 9, 2021 License: Unlicense Imports: 1 Imported by: 0

README

Topological Sorting

steps

  1. create graph, calculate in-degree for each node
  2. get node whose in-degree == 0, and put them in queue
  3. bfs, and recursively find nodes in-degree == 0 and put them back to queue

Documentation

The Go Gopher

There is no documentation for this package.

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.