This function runs a slight variation on the Warshall algorithm to find the largest posterior edge probability threshold that allows each pair of nodes to remain connected. It is useful for calculating ROC curves based on descendancy information.
A square matrix of probabilities.
The Warshall algorithm is O(P)^3, where P is the number of nodes.
A square matrix, where element (i,j) is the largest edge probability threshold that allows i to remain connected to j.
1 2 3 4 5 6
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.