edu.uci.ics.jung.graph
Interface Forest<V,E>

All Superinterfaces:
DirectedGraph<V,E>, Graph<V,E>, Hypergraph<V,E>
All Known Subinterfaces:
Tree<V,E>
All Known Implementing Classes:
DelegateForest, DelegateTree, OrderedKAryTree

public interface Forest<V,E>
extends DirectedGraph<V,E>

An interface for a graph which consists of a collection of rooted directed acyclic graphs.

Author:
Joshua O'Madadhain

Method Summary
 Collection<Tree<V,E>> getTrees()
          Returns a view of this graph as a collection of Tree instances.
 
Methods inherited from interface edu.uci.ics.jung.graph.Graph
addEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree
 
Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph
addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentEdges, getIncidentVertices, getNeighborCount, getNeighbors, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex
 

Method Detail

getTrees

Collection<Tree<V,E>> getTrees()
Returns a view of this graph as a collection of Tree instances.

Returns:
a view of this graph as a collection of Trees


Copyright © 2008 null. All Rights Reserved.