[BUG] Function minCut: Entry nodes

[discoleo]

Bug in Function minCut: Entry Nodes

There is a problem if the entry-nodes are part of the min-cut:

• these are new nodes which are NOT present in the actual graph;

R Code

• implement a warning that the entry-nodes are part of the min-cut;

• remove the entry-nodes from the partition (see also the helper function);

  minCut = function(m, id) { graph = as.graph.percol(m, id = id); idE = attr(graph, "entry"); idC = min_cut(graph, source = idE[1], target = idE[2], value.only = FALSE); edge = as.integer(idC$cut); ids = get.edgelist(graph)[edge,]; idEntry = which(ids %in% idE); # Graph Entry if(length(idEntry) > 0) { print("Min-Cut: Graph Entry!"); ids = ids[ - idEntry]; } idN = which.neighbors(m, ids); print(paste0("Finished Neighbours: ", length(idN))); # for DEBUG lst = list(value = idC$value, nodes = idC$cut, neighbors = idN, part = prune.part(idC$partition2, idE)); return (lst); }

Also make function which.neighbors more robust:

which.neighbors = function(m, npos, val = -1) {
    if(length(npos) == 0) return(integer(0));
    # ...

[discoleo]

The entry-nodes must be removed from the partition as well:

Helper function

prune.part = function(x, id) {
    idE = which(x %in% id);
    x = x[ - idE];
    invisible(x);
}