net.maizegenetics.util

Class GraphUtils<T>

net.maizegenetics.util.GraphUtils<T>

public class GraphUtils<T>

Functions used for Graph traversal and analysis

Method Detail

dfsLabeledEdges

public static <T> Tuple<java.util.ArrayList,java.util.ArrayList> dfsLabeledEdges(Graph<T> G,
                                                                                 T source)

Produces edges in a depth-first search starting at source and labeled -1,0,1 for forward, reverse, and nontree (direction type). Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July, 2004

Parameters:

G - A graph

source - The source node of the graph

Returns:

org.jetbrains.dokka.NodeRenderContent@42b1b1d0: A tuple of an arraylist containing the edges and an ArrayList containing the direction types

dfsPreorderNodes

public static <T> java.util.ArrayList<T> dfsPreorderNodes(Graph<T> G,
                                                          T source)

Produces nodes in a depth-first search pre-ordering starting at source (i.e. listing node starting with the source node)

Parameters:

G - A graph

source - The source node of the graph

Returns:

org.jetbrains.dokka.NodeRenderContent@9dbf405: An ArrayList with a depth-first search pre-ordering starting from source

dfsPostorderNodes

public static <T> java.util.ArrayList<T> dfsPostorderNodes(Graph<T> G,
                                                           T source)

Produces nodes in a depth-first search post-ordering starting at source (i.e. listing node starting with the last node and headed toward source)

Parameters:

G - A graph

source - The source node of the graph

Returns:

org.jetbrains.dokka.NodeRenderContent@4f1cb2fd: An ArrayList with a depth-first search post-ordering starting from source