Description Usage Arguments Value See Also
findstCut
reviews a given graph with a cut between
two nodes with the bread-first search strategy and
determines the two cut set of the partition. The cut is
marked in the arc list with an extra column that indicates
the remaining capacity of each arc.
1 |
nodes |
vector containing the nodes of the graph, identified by a number that goes from 1 to the order of the graph. |
arcs |
matrix with the list of arcs of the graph. Each row represents one arc. The first two columns contain the two endpoints of each arc and the third column contains their weights. |
s |
number pointing one node of the |
t |
number pointing one node of the |
findstCut
returns a list with two elements:
s.cut |
vector with the nodes of the |
t.cut |
vector with the nodes of the |
This function is an auxiliar function used in ghTreeGusfield and getMinimumCutTree.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.