org.gersteinlab.tyna.core.graph
Interface AdvancedUndirectedGraph

All Superinterfaces:

Graph, java.io.Serializable, UndirectedGraph

All Known Implementing Classes:

UndirectedMultiGraph, UndirectedSimpleGraph

public interface AdvancedUndirectedGraph

extends UndirectedGraph

	This interface declares advanced methods for undirected graphs such as
	motif mining that are not mandatory for basic implementations of
	UndirectedGraph classes.

	The methods are not synchronized for efficiency reasons. May need to
	change in the future if concurrent access is required.
	

Version:

1.0 (January 30, 2006) Change History: 1.0 - Initial version

Author:

Kevin Yuk-Lap Yip

Method Summary

java.util.List	getDefectiveCliquesMissingEdges(int k, int l) Get the missing edges in defective cliques formed by two cliques with .
java.util.List	getMaximalCliques() Get all maximal cliques
java.util.List	getMaximalIndependentSets() Get all maximal independent sets

Methods inherited from interface org.gersteinlab.tyna.core.graph.UndirectedGraph

getDegree, getDegrees, getEdges, getNeighbors

Methods inherited from interface org.gersteinlab.tyna.core.graph.Graph

addEdge, addNode, containsEdge, containsNode, getAttr, getAttrs, getEdgeCount, getEdgeIterator, getEdgeNodePairs, getNode, getNodeCount, getNodeIterator, setAttr

Method Detail

getMaximalIndependentSets

public java.util.List getMaximalIndependentSets()

Get all maximal independent sets

Returns:

A list of Node[], each containing the set of vertices in a maximal independent set

getMaximalCliques

public java.util.List getMaximalCliques()

Get all maximal cliques

Returns:

A list of Node[], each containing the set of vertices in a maximal clique

getDefectiveCliquesMissingEdges

public java.util.List getDefectiveCliquesMissingEdges(int k,
                                                      int l)
                                               throws java.lang.IllegalArgumentException

Get the missing edges in defective cliques formed by two cliques with . At least k vertices in common . At most l vertices not in common

Parameters:

k - The minimum size of the overlapped clique

l - The maximum number of nodes not in the overlapping clique

Returns:

A list of Node[], each containing the two vertices of a missing edge

Throws:

java.lang.IllegalArgumentException - If the inputs are invalid