tot <- tot + length(rownames(st[[i]]))
}
sp <- mat.or.vec(1,k)
- for (i in c(k+1:k))
+ for (i in c(k + 1:k))
sp[i - k] <- st[[i]]
astart <- mat.or.vec(1, tot) # start of aip, astart[p] is start of aip
dijp <- -1
if (l == p) { # calculate alpha_p
for (i in 1:n) {
- for (j in 1:n) { #check if {i,j}\subset L_l
+ for (j in 1:n) { # check if {i,j}\subset L_l
d <- st[[l]]
if (i != j & is.element(labels[i],rownames(d)) & is.element(labels[j],colnames(d))) {
dij <- d[rownames(d) == labels[i], colnames(d) == labels[j]]
}
} else {
for (i in 1:n) {
- for (j in 1:n) { #check if {i,j}\subset L_l
+ for (j in 1:n) { # check if {i,j}\subset L_l
d <- st[[l]]
if (i != j & is.element(labels[i], rownames(d)) & is.element(labels[j], colnames(d)) & is.element(labels[i], rownames(d_p)) & is.element(labels[j], colnames(d_p))) {
dij <- d[rownames(d) == labels[i], colnames(d) == labels[j]]
}
}
a <- solve(Q, col, 1e-19)
- for(i in 1:n) {
- for(j in 1:n) {
+ for (i in 1:n) {
+ for (j in 1:n) {
sum <- 0
sumv <- 0
- for(p in 1:k) {
+ for (p in 1:k) {
d <- st[[p]]
if (is.element(labels[i], rownames(d)) & is.element(labels[j], rownames(d))) {
ipos <- which(rownames(d) == labels[i])