Translated findCliques() + subfunctions

This commit is contained in:
Waldir Leoncio 2022-12-22 08:29:50 +01:00
parent 80ddbbdd00
commit 17a5ff66d6
6 changed files with 50 additions and 1 deletions

View file

@ -74,3 +74,4 @@ importFrom(stats,runif)
importFrom(stats,sd) importFrom(stats,sd)
importFrom(utils,read.delim) importFrom(utils,read.delim)
importFrom(vcfR,read.vcfR) importFrom(vcfR,read.vcfR)
importFrom(zeallot,"%<-%")

1
R/cliques_to_jtree.R Normal file
View file

@ -0,0 +1 @@
cliques_to_jtree <- function(cliques, ns) {}

1
R/elim_order.R Normal file
View file

@ -0,0 +1 @@
elim_order <- function(G, node_sizes) {}

View file

@ -1,3 +1,47 @@
findCliques <- function(M) { findCliques <- function(M) {
# TODO: translate findCliques() from matlab/spatial/findCliques.m # Muuttaa graafin M kolmioituvaksi ja laskee siitה klikit ja
# separaattorit.
# Hyצdynnetההn Kevin Murphyn algoritmeja Graph Theory toolboxista.
# Pהivitetty 12.8.2005
order <- elim_order(M, ones(length(M))) # TODO: translate from findCliques.m
c(G, cliques) %<-% triangulate(M, order) # TODO: translate from findCliques.m
c(jtree, root) %<-% cliques_to_jtree(cliques, ones(length(M))) # TODO: translate from findCliques.m
ncliq <- length(cliques)
separators <- cell(ncliq - 1, 1) # n - solmuisessa puussa n - 1 viivaa
jono <- zeros(length(ncliq))
jono[1] <- root
i <- 1
pointer <- 2 # Seuraava tyhjה paikka
while (!is.null(find(jono != 0))) { # Puun leveyssuuntainen lהpikהynti) {
lapset <- find(jtree[jono[i], ] != 0)
jtree[, jono[i]] <- 0 # Klikki kהsitelty
jono[pointer:(pointer + length(lapset) - 1)] <- lapset
for (j in 1:length(lapset)) {
ehdokas <- myintersect(cliques[[jono[i]]], cliques[[lapset[j]]])
kelpaa <- 1
for (k in 1:(pointer + j - 3)) {
# Tutkitaan, ettה separaattoriehdokasta ei vielה kהsitelty
if (ehdokas == separators[[k]]) {
kelpaa <- 0
}
}
if (kelpaa) {
separators[[pointer + j - 2]] <- ehdokas
}
}
jono[i] <- 0
pointer <- pointer + length(lapset)
i <- i + 1
}
notEmpty <- zeros(ncliq - 1, 1)
for (i in 1:(ncliq - 1)) {
if (!is.null(separators[[i]])) {
notEmpty[i] <- 1
}
}
notEmpty <- find(notEmpty == 1)
separators <- separators(notEmpty)
return(list("cliques" = cliques, "separators" = separators, "G" = G))
} }

1
R/myintersect.R Normal file
View file

@ -0,0 +1 @@
myintersect <- function(A, B) {}

1
R/triangulate.R Normal file
View file

@ -0,0 +1 @@
triangulate <- function(G, order) {}