public synchronized EdgeModel[] getEdgeModelsForEdges(Edge[] e) { if (e == null) { return null; } EdgeModel[] models = new EdgeModel[e.length]; for (int i = 0; i < e.length; i++) { int storeId = e[i].getStoreId(); models[i] = storeId < edges.length ? edges[e[i].getStoreId()] : null; } return models; }
@Override public boolean evaluate(Graph graph, Edge edge) { DirectedGraph directedGraph = (DirectedGraph) graph; //Make sure the edge is not self loop if (!edge.isSelfLoop()) { //Get the potential mutual edge Edge mutualEdge = directedGraph.getMutualEdge(edge); //Remove the mutual edge if exists //Make sure only one of the two mutual edges will be removed if (mutualEdge != null && mutualEdge.getStoreId() < edge.getStoreId()) { return false; } } return true; }
private void refreshDiff() { boolean node = AttributeUtils.isNodeColumn(column); columnDiff = node ? new NodeColumnDiffImpl() : new EdgeColumnDiffImpl(); int size = bitVector.size(); for (int i = 0; i < size; i++) { boolean t = bitVector.get(i); if (t && node) { if (graphStore.nodeStore.isValidIndex(i)) { Node n = graphStore.nodeStore.get(i); if (n.getStoreId() == i) { columnDiff.addElement(n); } } } else if (t && !node) { if (graphStore.edgeStore.isValidIndex(i)) { Edge e = graphStore.edgeStore.get(i); if (e.getStoreId() == i) { columnDiff.addElement(e); } } } } bitVector.clear(); }
private void refreshDiff() { boolean node = AttributeUtils.isNodeColumn(column); columnDiff = node ? new NodeColumnDiffImpl() : new EdgeColumnDiffImpl(); int size = bitVector.size(); for (int i = 0; i < size; i++) { boolean t = bitVector.get(i); if (t && node) { if (graphStore.nodeStore.isValidIndex(i)) { Node n = graphStore.nodeStore.get(i); if (n.getStoreId() == i) { columnDiff.addElement(n); } } } else if (t && !node) { if (graphStore.edgeStore.isValidIndex(i)) { Edge e = graphStore.edgeStore.get(i); if (e.getStoreId() == i) { columnDiff.addElement(e); } } } } bitVector.clear(); }
boolean t = edgeBitVector.get(e.getStoreId()); if (t && (!nodeBitVector.get(e.getSource().getStoreId()) || !nodeBitVector.get(e.getTarget() .getStoreId()))) {
boolean t = edgeBitVector.get(e.getStoreId()); if (t && (!nodeBitVector.get(e.getSource().getStoreId()) || !nodeBitVector.get(e.getTarget() .getStoreId()))) {
if (edge != null && (edge.getEdge().getStoreId() == -1 || (isView && !graph.contains(edge.getEdge())))) { float maxWeight = Float.MIN_VALUE; for (Edge edge : graph.getEdges()) { int id = edge.getStoreId(); EdgeModel model; if (id >= edges.length || edges[id] == null) {