alun.graph
Interface Graph<V,E>

All Known Subinterfaces:

MutableGraph<V,E>

All Known Implementing Classes:

AbstractGraph, CarefulNetwork, Decomposition, DirectedNetwork, IntervalTreeGraph, JunctionTree, LDModel, MarriageNodeMap, MaskedNetwork, Network, Product

public interface Graph<V,E>

Method Summary

E	connection(java.lang.Object u, java.lang.Object v)
boolean	connects(java.lang.Object x, java.lang.Object y)
boolean	contains(java.lang.Object x)
java.util.Collection<E>	getEdges()
java.util.Collection<V>	getNeighbours(java.lang.Object x)
java.util.Set<V>	getVertices()
java.util.Collection<V>	inNeighbours(java.lang.Object x)
java.util.Collection<V>	outNeighbours(java.lang.Object x)

Method Detail

contains

boolean contains(java.lang.Object x)

connects

boolean connects(java.lang.Object x,
                 java.lang.Object y)

getNeighbours

java.util.Collection<V> getNeighbours(java.lang.Object x)

inNeighbours

java.util.Collection<V> inNeighbours(java.lang.Object x)

outNeighbours

java.util.Collection<V> outNeighbours(java.lang.Object x)

getVertices

java.util.Set<V> getVertices()

connection

E connection(java.lang.Object u,
             java.lang.Object v)

getEdges

java.util.Collection<E> getEdges()