Description Usage Arguments Value Examples
View source: R/GetShortestPathsFromCCG.r
Gets the node names in the shortest path from one node in a CCG to another
1 2 | GetShortestPathsFromCCG(network, hypothesisnode, targetnode,
showbothdirs = FALSE, quiet = FALSE)
|
network |
built from iGraph |
hypothesisnode |
hypothesis node ID |
targetnode |
target node ID |
showbothdirs |
where multiple paths from a positive and negative node, FALSE returns only the shortest. Otherwise both are returned. |
quiet |
a flag to suppress output to console. FALSE by default. |
a list of vectors containing the nodes of individual paths
1 2 3 4 5 | network <- system.file(package='CausalR', 'extdata', 'testNetwork.sif')
ccg = CreateCCG(network)
hypothesisnode = 1
targetnode = 10
GetShortestPathsFromCCG (ccg, hypothesisnode, targetnode)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.