topological_sort: Topological graph sort
In teal.data: Data Model for 'teal' Applications
View source: R/topological_sort.R
topological_sort R Documentation
Topological graph sort
Description
Graph is a list which for each node contains a vector of child nodes
in the returned list, parents appear before their children.
Usage
topological_sort(graph)
Arguments
graph
(named list) with node vector elements
Details
Implementation of Kahn algorithm with a modification to maintain the order of input elements.
teal.data documentation built on May 29, 2024, 8:03 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
View source: R/topological_sort.R
| topological_sort | R Documentation |
Topological graph sort
Description
Graph is a list which for each node contains a vector of child nodes
in the returned list, parents appear before their children.
Usage
topological_sort(graph)
Arguments
graph |
( |
Details
Implementation of Kahn algorithm with a modification to maintain the order of input elements.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.