A function to test whether a subset of nodes separates two other subsets of nodes.
The function tests to see whether a set of nodes, S1, separates
all nodes in a from all nodes in b.
separates(a, b, S1, g)
a |
The names of the nodes in the from set. |
b |
The names of the nodes in the to set. |
S1 |
The names of the nodes in the separation set. |
g |
An instance of the |
The algorithm is quite simple. A subgraph is created by removing the
nodes named in S1 from g. Then all paths between
elements of a to elements of b are tested for. If any
path exists the function returns FALSE, otherwise it returns
TRUE.
Either TRUE or FALSE depending on whether S1 separates
a from b in g1.
R. Gentleman
S. Lauritzen, Graphical Models, OUP.
con <- file(system.file("XML/kmstEx.gxl",package="RBGL"))
km <- fromGXL(con)
close(con)
separates("B", "A", "E", km)
separates("B", "A", "C", km)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.