net.maizegenetics.util

Class DirectedGraph<T>

net.maizegenetics.util.DirectedGraph<T>

All Implemented Interfaces:

Graph<T>

public class DirectedGraph<T>
implements Graph<T>

Class used to represent a directed graph The design is inspired by the Python networkx library (https://networkx.github.io/)

Constructor Detail

DirectedGraph

public DirectedGraph(java.util.HashSet<T> nodes,
                     com.google.common.collect.ImmutableSetMultimap<T,T> adj,
                     com.google.common.collect.ImmutableSetMultimap<T,T> pred,
                     java.util.HashMap<net.maizegenetics.util.Tuple,java.lang.Double> wts)

Method Detail

nodesIter

public java.util.Iterator<T> nodesIter()

nodes

public java.util.Collection<T> nodes()

numberOfNodes

public int numberOfNodes()

hasNode

public boolean hasNode(T n)

hasEdge

public boolean hasEdge(T u,
                       T v)

neighbors

public java.util.Collection<T> neighbors(T n)

Gets the successors of the node n

Parameters:

n - A node

Returns:

org.jetbrains.dokka.NodeRenderContent@e33b51e: The collection of successors of the node (i.e. b in a->b)

successors

public java.util.Collection<T> successors(T n)

Gets the successors of the node n

Parameters:

n - A node

Returns:

org.jetbrains.dokka.NodeRenderContent@4c548025: The collection of successors of the node (i.e. b in a->b)

predecessors

public java.util.Collection<T> predecessors(T n)

Gets the predecessors of the node n

Parameters:

n - A node

Returns:

org.jetbrains.dokka.NodeRenderContent@7d1ffc33: The collection of predecessors of the node (i.e. a in a->b)

edges

public java.util.Collection<java.util.Map.Entry> edges()

edgesIter

public java.util.Iterator<java.util.Map.Entry> edgesIter()

degree

public int degree(T n)

inDegree

public int inDegree(T n)

Gets the number of nodes with an edge coming into the query node

Parameters:

n - The query node

Returns:

org.jetbrains.dokka.NodeRenderContent@712d794: The number of nodes with an edge coming into the query node

outDegree

public int outDegree(T n)

Gets the number of nodes hit by an edge coming out of the query node

Parameters:

n - The query node

Returns:

org.jetbrains.dokka.NodeRenderContent@141a192d: The number of nodes hit by an edge coming out of the query node

size

public int size()

size

public double size(boolean weighted)