10
$\begingroup$

Bug introduced in 9.0 and persisting through 12.0
FindVertexCut is new in 9.0.

Note: Before 10.3, the bug can be reproduced by wrapping the first argument in Graph.


Suppose I have this graph, given by:

edges = {TX -> R1, R1 -> R3, R3 -> R5, R5 -> RX, TX -> R2, R2 -> R4, 
   R4 -> R6, R6 -> RX, R1 -> R2, R2 -> R3, R3 -> R4, R4 -> R5, 
   R5 -> R6, TX -> R7, TX -> R8, R7 -> R9, R9 -> R6, R9 -> RX, 
   R8 -> R6};

its directed graph is below. When I use FindVertexCut[edges,TX,RX] it returns node {R5, R6}. To disconnect this graph I should be getting {R5,R6,R9}. Any advice? Second Question: On larger graphs, how can I find the minimum cut sets and minimum path sets where they may contain 1 element, 2 elements, 3 elements, ..., n elements?

enter image description here

$\endgroup$
  • $\begingroup$ You can use the {} button to display code properly. $\endgroup$ – Feyre Aug 30 '16 at 16:30
  • $\begingroup$ This seems wrong to me. FindShortestPath[Graph[edges], TX, RX] gives {TX, R7, R9, RX} which is unaffected by the cuts returned. $\endgroup$ – Jason B. Aug 30 '16 at 16:39
  • 4
    $\begingroup$ you should contact support@wolfram.com and report it. $\endgroup$ – halmir Aug 30 '16 at 16:43
  • 5
    $\begingroup$ Yet another bug! Is there any bug-free graph related functions? :( $\endgroup$ – Wjx Aug 31 '16 at 11:22

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.