Nothing
EliminationOrder <- function(graph, node.class){
dag.graph <- igraph.from.graphNEL(graph)
dis.nodes <- names(node.class[node.class])
cont.nodes <- names(node.class[!node.class])
# topological order for discrete subgraph
graph.dis <- induced_subgraph(dag.graph, dis.nodes)
# topological order for continuous subgraph
graph.cont <- induced_subgraph(dag.graph, cont.nodes)
eo.dis <- names(topological.sort(graph.dis))
eo.cont <- names(topological.sort(graph.cont))
# eliminate continuous node first, then discrete ones
result <- c(rev(eo.cont), rev(eo.dis))
return(result)
}
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.