Examples of EdgeType

Examples of com.intel.hadoop.graphbuilder.graph.glgraph.EdgeType

132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
    Iterator<EdgeType> iter = list.iterator();
    testEdges.add(myGraph.lvid(3));
    testEdges.add(myGraph.lvid(6));
    testEdges.add(myGraph.lvid(1));
    while (iter.hasNext()) {
      EdgeType e = iter.next();
      assertEquals(e.source(), myGraph.lvid(0));
      assertTrue(testEdges.contains(e.target()));
    }
    // iterate out edges of 1: null
    list = myGraph.outEdges(myGraph.lvid(1));
    assertTrue(list.isEmpty());

    // iterate in edges of 3: 0, 2
    list = myGraph.inEdges(myGraph.lvid(3));
    testEdges.clear();
    testEdges.add(myGraph.lvid(0));
    testEdges.add(myGraph.lvid(2));
    iter = list.iterator();
    while (iter.hasNext()) {
      EdgeType e = iter.next();
      assertEquals(e.target(), myGraph.lvid(3));
      assertTrue(testEdges.contains(e.source()));
    }
    // iterate in edges of 2: null
    list = myGraph.inEdges(myGraph.lvid(2));
    assertTrue(list.isEmpty());
  }
View Full Code Here

Examples of edu.uci.ics.jung.graph.util.EdgeType

45
46
47
48
49
50
51
52
53
54
55
   */
  public Double transform(VEPair<V, E> ve_pair)
  {
    E e = ve_pair.getE();
    V v = ve_pair.getV();
    EdgeType edge_type = graph.getEdgeType(e);
    if (edge_type == EdgeType.UNDIRECTED)
      return 1.0 / graph.degree(v);
    if (edge_type == EdgeType.DIRECTED)
      return 1.0 / graph.outDegree(graph.getSource(e));
    throw new IllegalArgumentException("can't handle edge type: " + edge_type);
View Full Code Here

Examples of edu.uci.ics.jung.graph.util.EdgeType

210
211
212
213
214
215
216
217
218
219
220
        e_string = "<edge ";
        // add ID if present
        if (id != null)
          e_string += "id=\"" + id + "\" ";
        // add edge type if doesn't match default
        EdgeType edge_type = g.getEdgeType(e);
        if (directed && edge_type == EdgeType.UNDIRECTED)
          e_string += "directed=\"false\" ";
        if (!directed && edge_type == EdgeType.DIRECTED)
          e_string += "directed=\"true\" ";
        e_string += "source=\"" + vertex_ids.transform(v1) +
View Full Code Here

Examples of edu.uci.ics.jung.graph.util.EdgeType

321
322
323
324
325
326
327
328
329
330
331
        if (! c_pred.evaluate(curLine))
            nextLine = skip(br, c_pred);

        boolean reading_arcs = false;
        boolean reading_edges = false;
        EdgeType directedness = null;
        if (a_pred.evaluate(nextLine))
        {
            if (g instanceof UndirectedGraph) {
                throw new IllegalArgumentException("Supplied undirected-only graph cannot be populated with directed edges");
            } else {
View Full Code Here

Examples of edu.uci.ics.jung.graph.util.EdgeType

731
732
733
734
735
736
737
738
739
740
741
        if (target == null)
            throw new SAXNotSupportedException("specified 'target' attribute " +
                "\"" + target_id + "\" does not match any node ID");

        String directed = edge_atts.remove("directed");
        EdgeType edge_type;
        if (directed == null)
            edge_type = default_edgetype;
        else if (directed.equals("true"))
            edge_type = EdgeType.DIRECTED;
        else if (directed.equals("false"))
View Full Code Here

Examples of edu.uci.ics.jung.graph.util.EdgeType

127
128
129
130
131
132
133
134
            assert(v != null);
            stringer.key(elements[idx++].name()).value(v.getElementId());
        } // FOR
       
        // Only store the first character of the edge type (U, D)
        EdgeType edge_type = this.graph.getEdgeType(this);
        stringer.key(Members.TYPE.name()).value(edge_type.name().subSequence(0, 1));
    }
View Full Code Here

Examples of edu.uci.ics.jung.graph.util.EdgeType

143
144
145
146
147
148
149
150
151
152
153
        AbstractVertex v1 = this.graph.getVertex(v1_elementId);
        assert(v1 != null) : "Invalid vertex element id '" + v1_elementId + "' (1)";
       
        // Edge Type
        String edge_type_key = object.getString(Members.TYPE.name());
        EdgeType edge_type = null;
        for (EdgeType e : EdgeType.values()) {
            if (e.name().startsWith(edge_type_key)) {
                edge_type = e;
                break;
            }
View Full Code Here

Examples of edu.uci.ics.jung.graph.util.EdgeType

129
130
131
132
133
134
135
136
137
138
139
        // user | file | file2 | user2 | weigth
        out.printLog("Iniciado calculo da métrica de matriz com " + getMatrix().getNodes().size() + " nodes. Parametros: " + params);
        AbstractTypedGraph<String, String> graphMulti;

        EdgeType type;
        out.printLog("Iniciando preenchimento do grapho.");
        if (getMatrix().getClassServicesName().equals(UserCommentedSamePairOfFileInDateServices.class.getName()) || getMatrix().getClassServicesName().equals(UserCommentedSamePairOfFileInAllDateServices.class.getName())) {
            graphMulti = new DirectedSparseMultigraph<>();
            type = EdgeType.DIRECTED;
        } else {
View Full Code Here

Examples of net.gleamynode.apiviz.EdgeType

622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
        buf.append("\"];");
        buf.append(NEWLINE);
    }

    private void renderEdge(PackageDoc pkg, StringBuilder buf, Edge edge) {
        EdgeType type = edge.getType();
        String lineColor = getLineColor(pkg, edge);
        String fontColor = getFontColor(pkg, edge);

        // Graphviz lays out nodes upside down - adjust for
        // important relationships.
        boolean reverse = false;
        switch (edge.getType()) {
        case GENERALIZATION:
        case REALIZATION:
        case DEPENDENCY:
            reverse = true;
        }

        // It should be reversed if only one important
        // relationship is found, otherwise, class hierarchy
        // will look cluttered.
        if (!reverse) {
            Set<Edge> allEdges = edges.get(edge.getSource());
            if (allEdges != null) {
                for (Edge e: allEdges) {
                    switch (e.getType()) {
                    case GENERALIZATION:
                    case REALIZATION:
                    case DEPENDENCY:
                        reverse = true;
                    }
                }
            }
        }

        if (reverse) {
            buf.append(getNodeId(edge.getTarget()));
            buf.append(" -> ");
            buf.append(getNodeId(edge.getSource()));
            buf.append(" [arrowhead=\"");
            buf.append(type.getArrowTail());
            buf.append("\", arrowtail=\"");
            buf.append(type.getArrowHead() == null? (edge.isOneway()? "open" : "none") : type.getArrowHead());
        } else {
            buf.append(getNodeId(edge.getSource()));
            buf.append(" -> ");
            buf.append(getNodeId(edge.getTarget()));
            buf.append(" [arrowhead=\"");
            buf.append(type.getArrowHead() == null? (edge.isOneway()? "open" : "none") : type.getArrowHead());
            buf.append("\", arrowtail=\"");
            buf.append(type.getArrowTail());
        }

        buf.append("\", style=\"" + type.getStyle());
        buf.append("\", color=\"");
        buf.append(lineColor);
        buf.append("\", fontcolor=\"");
        buf.append(fontColor);
        buf.append("\", label=\"");
View Full Code Here

Examples of net.gleamynode.apiviz.EdgeType

636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
        buf.append("\"];");
        buf.append(NEWLINE);
    }

    private void renderEdge(PackageDoc pkg, StringBuilder buf, Edge edge) {
        EdgeType type = edge.getType();
        String lineColor = getLineColor(pkg, edge);
        String fontColor = getFontColor(pkg, edge);

        // Graphviz lays out nodes upside down - adjust for
        // important relationships.
        boolean reverse = false;
        switch (edge.getType()) {
        case GENERALIZATION:
        case REALIZATION:
        case DEPENDENCY:
            reverse = true;
        }

        // It should be reversed if only one important
        // relationship is found, otherwise, class hierarchy
        // will look cluttered.
        if (!reverse) {
            Set<Edge> allEdges = edges.get(edge.getSource());
            if (allEdges != null) {
                for (Edge e: allEdges) {
                    switch (e.getType()) {
                    case GENERALIZATION:
                    case REALIZATION:
                    case DEPENDENCY:
                        reverse = true;
                    }
                }
            }
        }

        if (reverse) {
            buf.append(getNodeId(edge.getTarget()));
            buf.append(" -> ");
            buf.append(getNodeId(edge.getSource()));
            buf.append(" [arrowhead=\"");
            buf.append(type.getArrowTail());
            buf.append("\", arrowtail=\"");
            buf.append(type.getArrowHead() == null? (edge.isOneway()? "open" : "none") : type.getArrowHead());
        } else {
            buf.append(getNodeId(edge.getSource()));
            buf.append(" -> ");
            buf.append(getNodeId(edge.getTarget()));
            buf.append(" [arrowhead=\"");
            buf.append(type.getArrowHead() == null? (edge.isOneway()? "open" : "none") : type.getArrowHead());
            buf.append("\", arrowtail=\"");
            buf.append(type.getArrowTail());
        }

        buf.append("\", style=\"" + type.getStyle());
        buf.append("\", color=\"");
        buf.append(lineColor);
        buf.append("\", fontcolor=\"");
        buf.append(fontColor);
        buf.append("\", label=\"");
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.