UNAGI.dynamic_graphs.buildGraph.buildEdges

UNAGI.dynamic_graphs.buildGraph.buildEdges(stage1, stage2, midpath, iteration, cutoff=0.05)[source]

calculate the distance between two stages and connect the clusters in two stages with smallest distance with midpath in iterative training

Parameters:

  • midpath (str) – The task name

  • iteration (int) – The iteration of the training

  • stage1 (anndata) – The data of the first selected stage

  • stage2 (anndata) – The data of the second selected stage

  • cutoff (float) – The cutoff of p-value

Returns:

edges (list) – The edges between two stages