max/ourMELONS
1
0
Fork 0
Code Issues 1 Pull requests Projects Releases Packages Wiki Activity Actions

Translated triangulate()

Browse source
This commit is contained in:
Waldir Leoncio 2022-12-22 11:57:32 +01:00
parent 17019a9c94
commit eabfd2efea
1 changed files with 7 additions and 47 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

54
R/triangulate.R
View file

@ -16,64 +16,24 @@ triangulate <- function(G, order) {
U <- find(!eliminated)# uneliminated U <- find(!eliminated)# uneliminated
nodes <- myintersect(neighbors(G, u), U)# look up neighbors in the partially filled - in graph # TODO: translate neighbors nodes <- myintersect(neighbors(G, u), U)# look up neighbors in the partially filled - in graph # TODO: translate neighbors
nodes <- myunion(nodes, u)# the clique will always contain at least u # TODO: translate myunion nodes <- myunion(nodes, u)# the clique will always contain at least u # TODO: translate myunion
----------------------- line 21 -----------------------
G(nodes,nodes) = 1; % make them all connected to each other
G[nodes, nodes] <- 1# make them all connected to each other G[nodes, nodes] <- 1# make them all connected to each other
----------------------- line 22 ----------------------- G <- setdiag(G, 0) # TODO: translate setdiag
G = setdiag(G,0);
G <- setdiag(G, 0)
----------------------- line 23 -----------------------
eliminated(u) = 1;
eliminated[u] <- 1 eliminated[u] <- 1
----------------------- line 24 -----------------------
----------------------- line 25 -----------------------
exclude = 0;
exclude <- 0 exclude <- 0
----------------------- line 26 -----------------------
for c=1:length(cliques)
for (c in 1:length(cliques)) { for (c in 1:length(cliques)) {
----------------------- line 27 ----------------------- if (mysubset(nodes, cliques[[c]])) { # not maximal)
if mysubset(nodes,cliques{c}) % not maximal exclude <- 1
if (mysubset(nodes, cliques{c})# not maximal) { break
----------------------- line 28 ----------------------- }
exclude = 1;
exclude <- 1
----------------------- line 29 -----------------------
break;
break
----------------------- line 30 -----------------------
end
} }
----------------------- line 31 -----------------------
end
}
----------------------- line 32 -----------------------
if ~exclude
if (!exclude) { if (!exclude) {
----------------------- line 33 -----------------------
cnum = length(cliques)+1;
cnum <- length(cliques) + 1 cnum <- length(cliques) + 1
----------------------- line 34 ----------------------- cliques[[cnum]] <- nodes
cliques{cnum} = nodes;
cliques{cnum} = nodes
----------------------- line 35 -----------------------
end
} }
----------------------- line 36 -----------------------
end
} }
----------------------- line 37 -----------------------
----------------------- line 38 -----------------------
%fill_ins = sparse(triu(max(0, G - MG), 1));
# fill_ins <- sparse(triu(max(0, G - MG), 1)) # fill_ins <- sparse(triu(max(0, G - MG), 1))
----------------------- line 39 ----------------------- fill_ins <- 1
fill_ins=1;
fill_ins=1
----------------------- line 40 -----------------------
NA
return(list("G" = G, "cliques" = cliques, "fill_ins" = fill_ins)) return(list("G" = G, "cliques" = cliques, "fill_ins" = fill_ins))
} }