edu.uci.ics.jung.graph.filters
Class UnassembledGraph

java.lang.Object
  edu.uci.ics.jung.graph.filters.UnassembledGraph

public class UnassembledGraph

extends java.lang.Object

This class represents an unassembled graph. It does not implement Graph. It represents the collection of vertices and edges that were generated by the filter. VERTICES that are members of this DO NOT fulfill the vertex contract, as they claim their graph is the source graph.

The filter process looks like this:

 
  		SOURCE GRAPH - [ Filter1 ] - UnassembledGraph - [Filter2] - UnassembledGraph  - [Assemble] - Graph
  
 

Author:

danyelf

Constructor Summary

UnassembledGraph(Filter f, java.util.Set vertices, java.util.Set edges, Graph original)

UnassembledGraph(Filter f, java.util.Set vertices, java.util.Set edges, UnassembledGraph previous)

UnassembledGraph(java.lang.String name, java.util.Set vertices, java.util.Set edges, Graph original)
A constructor that uses non-Filters (for example, GraphCluterers) to build themselves.

Method Summary

Graph	assemble()
Graph	assemble(boolean shouldPreserveRecord) Constructs a new graph based on the source graph.
java.lang.String	getFilterName() Returns the name of the filter that generated this UnassembledGraph.
Graph	getOriginalGraph() Returns the original graph that was subsetted for this UnsassembledGraph.
java.util.Set	getUntouchedEdges() Returns the set of edges (from getOriginalGraph()) that passed the filter.
java.util.Set	getUntouchedVertices() Returns the set of vertices (from getOriginalGraph()) that passed the filter.
java.lang.String	toString()

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

UnassembledGraph

public UnassembledGraph(Filter f,
                        java.util.Set vertices,
                        java.util.Set edges,
                        Graph original)

UnassembledGraph

public UnassembledGraph(java.lang.String name,
                        java.util.Set vertices,
                        java.util.Set edges,
                        Graph original)

A constructor that uses non-Filters (for example, GraphCluterers) to build themselves.

Parameters:

name - A name to refer to the caller (e.g. "EdgeBetweenessCluster(3)")

vertices - The set of vertices in this UnassembledGraph

edges - The set of edges in this UnassembledGraph

original - The graph from which this data comes

UnassembledGraph

public UnassembledGraph(Filter f,
                        java.util.Set vertices,
                        java.util.Set edges,
                        UnassembledGraph previous)

Method Detail

getFilterName

public java.lang.String getFilterName()

Returns the name of the filter that generated this UnassembledGraph.

getOriginalGraph

public Graph getOriginalGraph()

Returns the original graph that was subsetted for this UnsassembledGraph.

getUntouchedVertices

public java.util.Set getUntouchedVertices()

Returns the set of vertices (from getOriginalGraph()) that passed the filter.

getUntouchedEdges

public java.util.Set getUntouchedEdges()

Returns the set of edges (from getOriginalGraph()) that passed the filter.

toString

public java.lang.String toString()

assemble

public Graph assemble(boolean shouldPreserveRecord)

Constructs a new graph based on the source graph. Assumes that edges should only be copied if they contain all the original edge's vertices; all vertices that pass the filter are copied.

Here's the general theory:

• A Graph object of the appropriate type can be obtained by calling Graph.newInstance() on the original.
• Then, the graph is populated with all vertices that the filters have passed (that is, the vertices in getUntouchedVertices(). Vertices are copied in with copy(Graph).
• Last, the graph is populated with all edges that have both passed, and have both ends in vertices that passed.

assemble

public Graph assemble()