GEXFAttributeMap(String type, Graph g) { this.type = type; Iterable<? extends Element> iterable; if (type.equals("node")) iterable = (Iterable<? extends Element>) g.getNodeSet(); else iterable = (Iterable<? extends Element>) g.getEdgeSet(); for (Element e : iterable) { for (String key : e.getAttributeKeySet()) { Object value = e.getAttribute(key); check(key, value); } } }
GEXFAttributeMap(String type, Graph g) { this.type = type; Iterable<? extends Element> iterable; if (type.equals("node")) iterable = (Iterable<? extends Element>) g.getNodeSet(); else iterable = (Iterable<? extends Element>) g.getEdgeSet(); for (Element e : iterable) { for (String key : e.getAttributeKeySet()) { Object value = e.getAttribute(key); check(key, value); } } }
edgeCount = graph.getEdgeCount(); } else { for (Edge e : graph.getEdgeSet()) { if (e.hasAttribute(weightMarker)) { edgeCount += (Double) e.getAttribute(weightMarker);
edgeCount = graph.getEdgeCount(); } else { for (Edge e : graph.getEdgeSet()) { if (e.hasAttribute(weightMarker)) { edgeCount += (Double) e.getAttribute(weightMarker);
@Override protected void makeTree() { if (treeEdges == null) treeEdges = new LinkedList<Edge>(); else treeEdges.clear(); List<Edge> sortedEdges = new ArrayList<Edge>(graph.getEdgeSet()); Collections.sort(sortedEdges, new EdgeComparator()); DisjointSets<Node> components = new DisjointSets<Node>( graph.getNodeCount()); for (Node node : graph) components.add(node); treeWeight = 0; for (Edge edge : sortedEdges) if (components.union(edge.getNode0(), edge.getNode1())) { treeEdges.add(edge); edgeOn(edge); treeWeight += getWeight(edge); if (treeEdges.size() == graph.getNodeCount() - 1) break; } sortedEdges.clear(); components.clear(); }
@Override protected void makeTree() { if (treeEdges == null) treeEdges = new LinkedList<Edge>(); else treeEdges.clear(); List<Edge> sortedEdges = new ArrayList<Edge>(graph.getEdgeSet()); Collections.sort(sortedEdges, new EdgeComparator()); DisjointSets<Node> components = new DisjointSets<Node>( graph.getNodeCount()); for (Node node : graph) components.add(node); treeWeight = 0; for (Edge edge : sortedEdges) if (components.union(edge.getNode0(), edge.getNode1())) { treeEdges.add(edge); edgeOn(edge); treeWeight += getWeight(edge); if (treeEdges.size() == graph.getNodeCount() - 1) break; } sortedEdges.clear(); components.clear(); }
return g.getEdgeSet().toArray(new Edge[g.getEdgeCount()]);
return g.getEdgeSet().toArray(new Edge[g.getEdgeCount()]);