getGraphlistdistance4Parts: getGraphlistdistance4Parts
In cds-group/GraphDistances: Distribution based distance computation between graphs

Description Usage Arguments Value Author(s) Examples

used when there are numerous graphs, the graph samples can be divided into four as specified by the index. Run in 4 separate R sessions. Save the 4 matrices and reassemble the gram matrix

1	getGraphlistdistance4Parts(distribMatlist, index = 1, returnnodeDist = FALSE)

`distribMatlist`	list of probability distribution matrices
`index`	possible values 1-4
`returnnodeDist`	Return node-wise distances(default=FALSE), if TRUE returns a list containing 2 elements: 1) nodewise distances and 2) graph distance (Gram) matrix

Gram matrix with Pairwise distances

Ichcha Manipur & Mario R Guarracino

## Not run: 
data("KidneyGraphs")
binsList <- getBins(KidneyGraphs)
nddList <- lapply(KidneyGraphs, function(x) getNodeDistanceDistr(x, binsList))
# Run the function in 4 separate terminals store the matrix and reassemble with
extractDist4part
nddDistanceMatPar1 <- getGraphlistdistance4Parts(nddList, index = 1)
# or use getGraphdistance4PartsParallel()
## End(Not run)