Example usage for org.apache.commons.collections15 Transformer interface-usage

List of usage examples for org.apache.commons.collections15 Transformer interface-usage

  1. HOME
  2. Java
  3. org.apache.commons.collections15.*
  4. Transformer
  5. Example usage for org.apache.commons.collections15 Transformer interface-usage

Introduction

In this page you can find the example usage for org.apache.commons.collections15 Transformer interface-usage.

Usage

From source file com.cablelabs.gui.scripts.visualizer.ConstTransformer.java

/**
 * A transformer that will give the same value for any input
 * Designed for use with the JUNG framework.
 *
 * Note: This was made because the ConstantTransformer<T> from apache commons was unable to
 *       take in both the IN and OUT types.

From source file com.cablelabs.gui.scripts.visualizer.StateStringer.java

/**
 * Creates a String label from a State.
 *
 * @author rvail
 *
 */

From source file com.cablelabs.gui.scripts.visualizer.TransitionStringer.java

/**
 * Creates a String label from a Transision
 *
 * @author rvail
 *
 */

From source file geneaquilt.algorithms.LayerClusterer.java

/**
 * Class LayerClusterer
 * @param <V> vertex class
 * @param <E> edge class
 * 
 * @author Jean-Daniel Fekete

From source file edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer.java

/**
 * An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
 * The betweenness of an edge is defined as the extent to which that edge lies along 
 * shortest paths between all pairs of nodes.
 *
 * This algorithm works by iteratively following the 2 step process:

From source file nz.co.gregs.dbvolution.internal.querygraph.QueryGraphVertexFillPaintTransformer.java

/**
 *
 * @author gregory.graham
 */
public class QueryGraphVertexFillPaintTransformer implements Transformer<QueryGraphNode, Paint> {

From source file storybook.ui.memoria.EntityTransformer.java

public class EntityTransformer implements Transformer<AbstractEntity, String> {

    @Override
    public String transform(AbstractEntity p) {
        return EntityUtil.getToolTip(p);
    }

From source file be.fedict.eid.applet.maven.MyEdgeTransformer.java

public class MyEdgeTransformer implements Transformer<String, Paint> {

    public Paint transform(String edgeName) {
        return Color.BLACK;
    }
}

From source file edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer.java

/**
 * Finds all biconnected components (bicomponents) of an undirected graph.  
 * A graph is a biconnected component if 
 * at least 2 vertices must be removed in order to disconnect the graph.  (Graphs 
 * consisting of one vertex, or of two connected vertices, are also biconnected.)  Biconnected
 * components of three or more vertices have the property that every pair of vertices in the component

From source file com.jungstudy.EdgeBetweennessClusterer.java

/**
 * An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
 * [Note: The betweenness of an edge measure the extent to which that edge lies along shortest paths
 * between all pairs of nodes.]
 * Edges which are least central to communities are progressively removed until the communities
 * have been adequately seperated.