topologicalSort: Do a topological sort on a graph
In anhinton/conduit: A prototype glue system for OpenAPI
Description
Usage
Arguments
Details
Value
Description
Return a linear ordering of vertices in an acyclic directed graph
such that for every directed edge from u to v, u comes before v in
the ordering.
Usage
1
topologicalSort(edges)
Arguments
edges
named list of edges from each vertex as character
vector
Details
edges list should be named for each vertex in the
graph. Each vertex object should be a character vector of vectors
to which the vector has a directed edge.
Uses Kahn's algorithm
https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm
Value
character vector of sorted vertices
anhinton/conduit documentation built on May 10, 2019, 11:48 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.
Description Usage Arguments Details Value
Description
Return a linear ordering of vertices in an acyclic directed graph such that for every directed edge from u to v, u comes before v in the ordering.
Usage
1 | topologicalSort(edges)
|
Arguments
edges |
named list of edges from each vertex as character vector |
Details
edges list should be named for each vertex in the
graph. Each vertex object should be a character vector of vectors
to which the vector has a directed edge.
Uses Kahn's algorithm https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm
Value
character vector of sorted vertices
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.