Why does the error “At st-cuts.c:415 : Invalid root vertex id for dominator tree, Invalid value” occur in...











up vote
0
down vote

favorite












I have the following matrix EdgesGroep as input for graph.adjacency (sorry for the ugly way of giving the matrix):



 [1,] 0 0 0 0 0 0 0 0 0  0  0  0  0
[2,] 0 0 0 1 0 0 0 0 0 0 0 0 0
[3,] 0 0 0 0 0 0 0 0 0 0 0 0 0
[4,] 0 1 0 0 0 0 0 0 0 0 0 0 0
[5,] 0 0 0 0 0 1 0 0 1 1 1 0 0
[6,] 0 0 0 0 1 0 1 0 0 0 0 0 0
[7,] 0 0 0 0 0 1 0 0 0 0 1 0 0
[8,] 0 0 0 0 0 0 0 0 0 1 1 1 0
[9,] 0 0 0 0 1 0 0 0 0 1 0 0 0
[10,] 0 0 0 0 1 0 0 1 1 0 1 0 0
[11,] 0 0 0 0 1 0 1 1 0 1 0 0 0
[12,] 0 0 0 0 0 0 0 1 0 0 0 0 0
[13,] 0 0 0 0 0 0 0 0 0 0 0 0 0

EdgesGroep <- as.matrix(EdgesGroep)
colnames(EdgesGroep) <- 1:dim(EdgesGroep)[1]
g1 <- graph.adjacency(EdgesGroep, mode="directed", weighted=NULL)
tkplot(g1)
V <- V(g1)
E <- get.edgelist(g1)
mode(E) <- "integer"
stCuts(g1, source=V[7], target=V[8])


Then the error occurs




Error in stCuts(g1, source = V[7], target = V[8]) :
At st-cuts.c:415 : Invalid root vertex id for dominator tree, Invalid value




I actually want to obtain the cuts between all pair of nodes. I already have code to do that, but then the stCuts function should work.



Can anyone help discovering what to do to fix the error?










share|improve this question
























  • For many (source,target) combinations it works to switch the order: st_cuts(g1, source=V[8], target=V[11]) does not work but st_cuts(g1, source=V[11], target=V[8]) does work. (source,target) combinations that do not work that way are (9,11) , (10,11) and (7, 8-11). I have no idea why the switched order for some combinations work and others does not...
    – Jorden
    Nov 13 at 10:02










  • This is a bug in the igraph C core: github.com/igraph/igraph/issues/1102
    – Szabolcs
    Nov 15 at 12:55















up vote
0
down vote

favorite












I have the following matrix EdgesGroep as input for graph.adjacency (sorry for the ugly way of giving the matrix):



 [1,] 0 0 0 0 0 0 0 0 0  0  0  0  0
[2,] 0 0 0 1 0 0 0 0 0 0 0 0 0
[3,] 0 0 0 0 0 0 0 0 0 0 0 0 0
[4,] 0 1 0 0 0 0 0 0 0 0 0 0 0
[5,] 0 0 0 0 0 1 0 0 1 1 1 0 0
[6,] 0 0 0 0 1 0 1 0 0 0 0 0 0
[7,] 0 0 0 0 0 1 0 0 0 0 1 0 0
[8,] 0 0 0 0 0 0 0 0 0 1 1 1 0
[9,] 0 0 0 0 1 0 0 0 0 1 0 0 0
[10,] 0 0 0 0 1 0 0 1 1 0 1 0 0
[11,] 0 0 0 0 1 0 1 1 0 1 0 0 0
[12,] 0 0 0 0 0 0 0 1 0 0 0 0 0
[13,] 0 0 0 0 0 0 0 0 0 0 0 0 0

EdgesGroep <- as.matrix(EdgesGroep)
colnames(EdgesGroep) <- 1:dim(EdgesGroep)[1]
g1 <- graph.adjacency(EdgesGroep, mode="directed", weighted=NULL)
tkplot(g1)
V <- V(g1)
E <- get.edgelist(g1)
mode(E) <- "integer"
stCuts(g1, source=V[7], target=V[8])


Then the error occurs




Error in stCuts(g1, source = V[7], target = V[8]) :
At st-cuts.c:415 : Invalid root vertex id for dominator tree, Invalid value




I actually want to obtain the cuts between all pair of nodes. I already have code to do that, but then the stCuts function should work.



Can anyone help discovering what to do to fix the error?










share|improve this question
























  • For many (source,target) combinations it works to switch the order: st_cuts(g1, source=V[8], target=V[11]) does not work but st_cuts(g1, source=V[11], target=V[8]) does work. (source,target) combinations that do not work that way are (9,11) , (10,11) and (7, 8-11). I have no idea why the switched order for some combinations work and others does not...
    – Jorden
    Nov 13 at 10:02










  • This is a bug in the igraph C core: github.com/igraph/igraph/issues/1102
    – Szabolcs
    Nov 15 at 12:55













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I have the following matrix EdgesGroep as input for graph.adjacency (sorry for the ugly way of giving the matrix):



 [1,] 0 0 0 0 0 0 0 0 0  0  0  0  0
[2,] 0 0 0 1 0 0 0 0 0 0 0 0 0
[3,] 0 0 0 0 0 0 0 0 0 0 0 0 0
[4,] 0 1 0 0 0 0 0 0 0 0 0 0 0
[5,] 0 0 0 0 0 1 0 0 1 1 1 0 0
[6,] 0 0 0 0 1 0 1 0 0 0 0 0 0
[7,] 0 0 0 0 0 1 0 0 0 0 1 0 0
[8,] 0 0 0 0 0 0 0 0 0 1 1 1 0
[9,] 0 0 0 0 1 0 0 0 0 1 0 0 0
[10,] 0 0 0 0 1 0 0 1 1 0 1 0 0
[11,] 0 0 0 0 1 0 1 1 0 1 0 0 0
[12,] 0 0 0 0 0 0 0 1 0 0 0 0 0
[13,] 0 0 0 0 0 0 0 0 0 0 0 0 0

EdgesGroep <- as.matrix(EdgesGroep)
colnames(EdgesGroep) <- 1:dim(EdgesGroep)[1]
g1 <- graph.adjacency(EdgesGroep, mode="directed", weighted=NULL)
tkplot(g1)
V <- V(g1)
E <- get.edgelist(g1)
mode(E) <- "integer"
stCuts(g1, source=V[7], target=V[8])


Then the error occurs




Error in stCuts(g1, source = V[7], target = V[8]) :
At st-cuts.c:415 : Invalid root vertex id for dominator tree, Invalid value




I actually want to obtain the cuts between all pair of nodes. I already have code to do that, but then the stCuts function should work.



Can anyone help discovering what to do to fix the error?










share|improve this question















I have the following matrix EdgesGroep as input for graph.adjacency (sorry for the ugly way of giving the matrix):



 [1,] 0 0 0 0 0 0 0 0 0  0  0  0  0
[2,] 0 0 0 1 0 0 0 0 0 0 0 0 0
[3,] 0 0 0 0 0 0 0 0 0 0 0 0 0
[4,] 0 1 0 0 0 0 0 0 0 0 0 0 0
[5,] 0 0 0 0 0 1 0 0 1 1 1 0 0
[6,] 0 0 0 0 1 0 1 0 0 0 0 0 0
[7,] 0 0 0 0 0 1 0 0 0 0 1 0 0
[8,] 0 0 0 0 0 0 0 0 0 1 1 1 0
[9,] 0 0 0 0 1 0 0 0 0 1 0 0 0
[10,] 0 0 0 0 1 0 0 1 1 0 1 0 0
[11,] 0 0 0 0 1 0 1 1 0 1 0 0 0
[12,] 0 0 0 0 0 0 0 1 0 0 0 0 0
[13,] 0 0 0 0 0 0 0 0 0 0 0 0 0

EdgesGroep <- as.matrix(EdgesGroep)
colnames(EdgesGroep) <- 1:dim(EdgesGroep)[1]
g1 <- graph.adjacency(EdgesGroep, mode="directed", weighted=NULL)
tkplot(g1)
V <- V(g1)
E <- get.edgelist(g1)
mode(E) <- "integer"
stCuts(g1, source=V[7], target=V[8])


Then the error occurs




Error in stCuts(g1, source = V[7], target = V[8]) :
At st-cuts.c:415 : Invalid root vertex id for dominator tree, Invalid value




I actually want to obtain the cuts between all pair of nodes. I already have code to do that, but then the stCuts function should work.



Can anyone help discovering what to do to fix the error?







r igraph






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Nov 13 at 11:41

























asked Nov 12 at 14:26









Jorden

62




62












  • For many (source,target) combinations it works to switch the order: st_cuts(g1, source=V[8], target=V[11]) does not work but st_cuts(g1, source=V[11], target=V[8]) does work. (source,target) combinations that do not work that way are (9,11) , (10,11) and (7, 8-11). I have no idea why the switched order for some combinations work and others does not...
    – Jorden
    Nov 13 at 10:02










  • This is a bug in the igraph C core: github.com/igraph/igraph/issues/1102
    – Szabolcs
    Nov 15 at 12:55


















  • For many (source,target) combinations it works to switch the order: st_cuts(g1, source=V[8], target=V[11]) does not work but st_cuts(g1, source=V[11], target=V[8]) does work. (source,target) combinations that do not work that way are (9,11) , (10,11) and (7, 8-11). I have no idea why the switched order for some combinations work and others does not...
    – Jorden
    Nov 13 at 10:02










  • This is a bug in the igraph C core: github.com/igraph/igraph/issues/1102
    – Szabolcs
    Nov 15 at 12:55
















For many (source,target) combinations it works to switch the order: st_cuts(g1, source=V[8], target=V[11]) does not work but st_cuts(g1, source=V[11], target=V[8]) does work. (source,target) combinations that do not work that way are (9,11) , (10,11) and (7, 8-11). I have no idea why the switched order for some combinations work and others does not...
– Jorden
Nov 13 at 10:02




For many (source,target) combinations it works to switch the order: st_cuts(g1, source=V[8], target=V[11]) does not work but st_cuts(g1, source=V[11], target=V[8]) does work. (source,target) combinations that do not work that way are (9,11) , (10,11) and (7, 8-11). I have no idea why the switched order for some combinations work and others does not...
– Jorden
Nov 13 at 10:02












This is a bug in the igraph C core: github.com/igraph/igraph/issues/1102
– Szabolcs
Nov 15 at 12:55




This is a bug in the igraph C core: github.com/igraph/igraph/issues/1102
– Szabolcs
Nov 15 at 12:55

















active

oldest

votes











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53264231%2fwhy-does-the-error-at-st-cuts-c415-invalid-root-vertex-id-for-dominator-tree%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Stack Overflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53264231%2fwhy-does-the-error-at-st-cuts-c415-invalid-root-vertex-id-for-dominator-tree%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

鏡平學校

ꓛꓣだゔៀៅຸ໢ທຮ໕໒ ,ໂ'໥໓າ໼ឨឲ៵៭ៈゎゔit''䖳𥁄卿' ☨₤₨こゎもょの;ꜹꟚꞖꞵꟅꞛေၦေɯ,ɨɡ𛃵𛁹ޝ޳ޠ޾,ޤޒޯ޾𫝒𫠁သ𛅤チョ'サノބޘދ𛁐ᶿᶇᶀᶋᶠ㨑㽹⻮ꧬ꧹؍۩وَؠ㇕㇃㇪ ㇦㇋㇋ṜẰᵡᴠ 軌ᵕ搜۳ٰޗޮ޷ސޯ𫖾𫅀ल, ꙭ꙰ꚅꙁꚊꞻꝔ꟠Ꝭㄤﺟޱސꧨꧼ꧴ꧯꧽ꧲ꧯ'⽹⽭⾁⿞⼳⽋២៩ញណើꩯꩤ꩸ꩮᶻᶺᶧᶂ𫳲𫪭𬸄𫵰𬖩𬫣𬊉ၲ𛅬㕦䬺𫝌𫝼,,𫟖𫞽ហៅ஫㆔ాఆఅꙒꚞꙍ,Ꙟ꙱エ ,ポテ,フࢰࢯ𫟠𫞶 𫝤𫟠ﺕﹱﻜﻣ𪵕𪭸𪻆𪾩𫔷ġ,ŧآꞪ꟥,ꞔꝻ♚☹⛵𛀌ꬷꭞȄƁƪƬșƦǙǗdžƝǯǧⱦⱰꓕꓢႋ神 ဴ၀க௭எ௫ឫោ ' េㇷㇴㇼ神ㇸㇲㇽㇴㇼㇻㇸ'ㇸㇿㇸㇹㇰㆣꓚꓤ₡₧ ㄨㄟ㄂ㄖㄎ໗ツڒذ₶।ऩछएोञयूटक़कयँृी,冬'𛅢𛅥ㇱㇵㇶ𥄥𦒽𠣧𠊓𧢖𥞘𩔋цѰㄠſtʯʭɿʆʗʍʩɷɛ,əʏダヵㄐㄘR{gỚṖḺờṠṫảḙḭᴮᵏᴘᵀᵷᵕᴜᴏᵾq﮲ﲿﴽﭙ軌ﰬﶚﶧ﫲Ҝжюїкӈㇴffצּ﬘﭅﬈軌'ffistfflſtffतभफɳɰʊɲʎ𛁱𛁖𛁮𛀉 𛂯𛀞నఋŀŲ 𫟲𫠖𫞺ຆຆ ໹້໕໗ๆทԊꧢꧠ꧰ꓱ⿝⼑ŎḬẃẖỐẅ ,ờỰỈỗﮊDžȩꭏꭎꬻ꭮ꬿꭖꭥꭅ㇭神 ⾈ꓵꓑ⺄㄄ㄪㄙㄅㄇstA۵䞽ॶ𫞑𫝄㇉㇇゜軌𩜛𩳠Jﻺ‚Üမ႕ႌႊၐၸဓၞၞၡ៸wyvtᶎᶪᶹစဎ꣡꣰꣢꣤ٗ؋لㇳㇾㇻㇱ㆐㆔,,㆟Ⱶヤマފ޼ޝަݿݞݠݷݐ',ݘ,ݪݙݵ𬝉𬜁𫝨𫞘くせぉて¼óû×ó£…𛅑הㄙくԗԀ5606神45,神796'𪤻𫞧ꓐ㄁ㄘɥɺꓵꓲ3''7034׉ⱦⱠˆ“𫝋ȍ,ꩲ軌꩷ꩶꩧꩫఞ۔فڱێظペサ神ナᴦᵑ47 9238їﻂ䐊䔉㠸﬎ffiﬣ,לּᴷᴦᵛᵽ,ᴨᵤ ᵸᵥᴗᵈꚏꚉꚟ⻆rtǟƴ𬎎

Guess what letter conforming each word