Description Usage Arguments Details See Also
A routes matrix is a matrix A, such that each element (i, j) is the number of routes from i to j in some directed graph.
1 | routesRemoveEdges(x, i, j)
|
x |
A routes matrix |
i |
The nodes from which the removed edge emanates |
j |
The node that the removed edge goes to. ONLY ONE NODE HERE |
This function updates the routes matrix to account for the deletion of an edge from i to j in the directed graph
routesAddEdges
,
nonDescendants
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.