org.grouplens.grapht.graph

Class MergePool<V,E>

java.lang.Object

org.grouplens.grapht.graph.MergePool<V,E>

Type Parameters:

V - The vertex type of graphs to merge.

E - The edge type of graphs to merge.

public class MergePool<V,E>
extends Object

Merges graphs to remove redundant nodes. This takes graphs and merges them, pruning redundant nodes within the graphs and between graphs previously merged. It remembers graphs it has previously seen to allow nodes to be reused across multiple graphs.

Since:

0.7

Author:

GroupLens Research

Method Summary

Methods

Modifier and Type	Method and Description
static <V,E> MergePool<V,E>	create() Create a merge pool that checks node labels for equality.
DAGNode<V,E>	merge(DAGNode<V,E> graph) Merge and simplify a graph.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

create

public static <V,E> MergePool<V,E> create()

Create a merge pool that checks node labels for equality.

Type Parameters:

V - The node label type.

E - The edge label type.

Returns:

A new merge pool.

merge

public DAGNode<V,E> merge(DAGNode<V,E> graph)

Merge and simplify a graph. This will coalesce redundant nodes (equivalent labels and outgoing edge destinations), and will prefer to use nodes from graphs seen previously. This allows deduplication across multiple graphs.

Noteo: edge labels are ignored for the purpose of merging.

Parameters:

graph - The graph to simplify.

Returns:

The new simplified, merged graph.