Perform topological sorting.
import topologicalsort;
auto verticesList = [[0, 1], [0, 2], [2, 3], [1, 3]];
auto result = verticesList.topologicalSort; // [0, 1, 2, 3]
-
Notifications
You must be signed in to change notification settings - Fork 0
tanitta/topological-sort-d
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An implementation of topological sorting in D programming language
Resources
Stars
Watchers
Forks
Packages 0
No packages published