Must not add any null, undefined or empty string node.
var TopoSort = require('topo-sort');
var tsort = new TopoSort();
tsort.add('a', ['b', 'c']);
tsort.add('d', ['a', 'b', 'c']);
// Output d,a,c,b
var l = tsort.sort();-
Notifications
You must be signed in to change notification settings - Fork 1
Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.
License
liy/topo-sort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published