net.maizegenetics.util

Class UndirectedGraph<T>

net.maizegenetics.util.UndirectedGraph<T>

All Implemented Interfaces:

Graph<T>

public class UndirectedGraph<T>
implements Graph<T>

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

Constructor Detail

UndirectedGraph

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

Constructs an undirected graph

Parameters:

nodes - Set of nodes

adj - Multimap of adjacency between nodes

wts - Hashmap of an edge (represented by a Map Entry) and weights

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)

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)

size

public int size()

size

public double size(boolean weighted)