Package org.apache.commons.collections15.comparators

Examples of org.apache.commons.collections15.comparators.BooleanComparator

749
750
751
752
753
754
755
756
757
758
759
        else if (source == fill_edges)
        {
          if(source.isSelected()) {
            vv.getRenderContext().setEdgeFillPaintTransformer( edgeFillPaint );
          } else {
            vv.getRenderContext().setEdgeFillPaintTransformer( new ConstantTransformer(null) );
          }
//            edgePaint.useFill(source.isSelected());
        }
        vv.repaint();
    }
View Full Code Here
224
225
226
227
228
229
230
231
232
233
234
235
236
                    } else {
                        return Color.BLACK;
                    }
                }
            });
            vv.getRenderContext().setEdgeDrawPaintTransformer(new ConstantTransformer(Color.lightGray));
            vv.getRenderContext().setArrowFillPaintTransformer(new ConstantTransformer(Color.lightGray));
            vv.getRenderContext().setArrowDrawPaintTransformer(new ConstantTransformer(Color.lightGray));

            // add my listeners for ToolTips
            vv.setVertexToolTipTransformer(new ToStringLabeller<String>() {
            });
View Full Code Here
47
48
49
50
51
52
53
   */
  @SuppressWarnings("unchecked")
  public BetweennessCentrality(Graph<V, E> graph)
  {
    initialize(graph);
    computeBetweenness(new LinkedList<V>(), new ConstantTransformer(1));
  }
View Full Code Here
59
60
61
62
63
64
65
66
     */
    @SuppressWarnings("unchecked")
    public HITSWithPriors(Hypergraph<V,E> g,
          Transformer<V, HITS.Scores> vertex_priors, double alpha)
    {
      super(g, new ConstantTransformer(1.0), vertex_priors, alpha);
        disappearing_potential = new HITS.Scores(0,0);
    }
View Full Code Here
109
110
111
112
113
114
115
     *
     * @param g     the graph on which distances will be calculated
     */
    @SuppressWarnings("unchecked")
    public DijkstraDistance(Graph<V,E> g) {
        this(g, new ConstantTransformer(1), true);
    }
View Full Code Here
122
123
124
125
126
127
128
     * @param g     the graph on which distances will be calculated
     * @param cached    specifies whether the results are to be cached
     */
    @SuppressWarnings("unchecked")
    public DijkstraDistance(Graph<V,E> g, boolean cached) {
        this(g, new ConstantTransformer(1), cached);
    }
View Full Code Here
53
54
55
56
57
58
59
     * dimension--the input knows how big the graph is. Defaults to the unit
     * length function.
     */
    @SuppressWarnings("unchecked")
    public SpringLayout(Graph<V,E> g) {
        this(g, new ConstantTransformer(30));
    }
View Full Code Here
28
29
30
31
32
33
34
 
  /**
   * Creates an instance which generates a minimum spanning tree assuming constant edge weights.
   */
  public PrimMinimumSpanningTree(Factory<? extends Graph<V,E>> factory) {
    this(factory, new ConstantTransformer(1.0));
  }
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
            public void actionPerformed(ActionEvent ae) {
              Dimension d = new Dimension(600,600);
                if (switchLayout.getText().indexOf("Spring") > 0) {
                    switchLayout.setText("Switch to FRLayout");
                    layout = new SpringLayout<Number,Number>(g,
                        new ConstantTransformer(EDGE_LENGTH));
                    layout.setSize(d);
                    vv.getModel().setGraphLayout(layout, d);
                } else {
                    switchLayout.setText("Switch to SpringLayout");
                    layout = new FRLayout<Number,Number>(g, d);
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
            throw new IllegalArgumentException("Supplied Forest must be empty");
        }
        this.graph = graph;
        this.forest = forest;
        this.weights = LazyMap.decorate(new HashMap<E,Double>(),
                new ConstantTransformer(1.0));
        Set<E> unfinishedEdges = new HashSet<E>(graph.getEdges());
        if(graph.getVertices().contains(root)) {
            this.forest.addVertex(root);
        }
        updateForest(forest.getVertices(), unfinishedEdges);
View Full Code Here
TOP

Related Classes of org.apache.commons.collections15.comparators.BooleanComparator

  • edu.uci.ics.jung.samples.PluggableRendererDemo
  • junit.framework.TestSuite
  • org.apache.commons.collections15.ArrayStack
  • org.apache.commons.collections15.Bag
  • org.apache.commons.collections15.bag.AbstractMapBag
  • org.apache.commons.collections15.bag.AbstractTestBag
  • org.apache.commons.collections15.bag.HashBag
  • org.apache.commons.collections15.bag.TestPredicatedBag
  • org.apache.commons.collections15.bag.TestPredicatedSortedBag
  • org.apache.commons.collections15.bag.TestTreeBag
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.