mindis8pam: finds the minimum distance between every pair of nodes

In g4n: graph for networks

Description

(ba) From the parentship matrix, the minimum distance matrix between every pairs of nodes is computed. [i,j] means from node ith to node jth. In most cases (especially for non empty dags) the matrix is not symmetric.
The distance (not a mathematical distance) is the minimal number of arcs to follow before reaching the node j starting from the node i.

Usage

mindis8pam(pam)

Arguments

pam	The pam matrix to be investigated

Details

-1 are introduced on the diagonal.

Value

The matrix containing the distances

Examples

 g4n3k("RESET"); # needed only for R checking, to be forgotten
 mindis8pam(g4n.pam1);

g4n documentation built on May 2, 2019, 5:47 p.m.