@Override public Edge<K, NullValue> map(Edge<K, NullValue> inEdge) throws Exception { // flip vertices if necessary if (inEdge.getSource().compareTo(inEdge.getTarget()) > 0) { inEdge = inEdge.reverse(); } return inEdge; } }
@Override public void flatMap(Edge<K, EV> edge, Collector<Edge<K, EV>> out) throws Exception { out.collect(edge); Edge<K, EV> reversed = edge.reverse(); out.collect(reversed); } }
@Override public Edge<K, NullValue> map(EdgeWithDegrees<K> inEdge) throws Exception { // copy vertices to simple edge outEdge.setSource(inEdge.getFirstVertex()); outEdge.setTarget(inEdge.getSecondVertex()); outEdge.setValue(NullValue.getInstance()); // flip vertices if first degree is larger than second degree. if (inEdge.getFirstDegree() > inEdge.getSecondDegree()) { outEdge = outEdge.reverse(); } // return edge return outEdge; } }
@Override public Edge<K, EV> map(Edge<K, EV> edge) throws Exception { return edge.reverse(); } }
@Override public Edge<K, NullValue> map(Edge<K, NullValue> inEdge) throws Exception { // flip vertices if necessary if (inEdge.getSource().compareTo(inEdge.getTarget()) > 0) { inEdge = inEdge.reverse(); } return inEdge; } }
@Override public Edge<K, NullValue> map(Edge<K, NullValue> inEdge) throws Exception { // flip vertices if necessary if (inEdge.getSource().compareTo(inEdge.getTarget()) > 0) { inEdge = inEdge.reverse(); } return inEdge; } }
@Override public Edge<K, NullValue> map(Edge<K, NullValue> inEdge) throws Exception { // flip vertices if necessary if (inEdge.getSource().compareTo(inEdge.getTarget()) > 0) { inEdge = inEdge.reverse(); } return inEdge; } }
@Override public void flatMap(Edge<K, EV> edge, Collector<Edge<K, EV>> out) { out.collect(edge); out.collect(edge.reverse()); } };
@Override public void flatMap(Edge<K, EV> edge, Collector<Edge<K, EV>> out) throws Exception { out.collect(edge); Edge<K, EV> reversed = edge.reverse(); out.collect(reversed); } }
@Override public void flatMap(Edge<K, EV> edge, Collector<Edge<K, EV>> out) throws Exception { out.collect(edge); Edge<K, EV> reversed = edge.reverse(); out.collect(reversed); } }
@Override public void flatMap(Edge<K, EV> edge, Collector<Edge<K, EV>> out) throws Exception { out.collect(edge); Edge<K, EV> reversed = edge.reverse(); out.collect(reversed); } }
@Override public Edge<K, NullValue> map(EdgeWithDegrees<K> inEdge) throws Exception { // copy vertices to simple edge outEdge.setSource(inEdge.getFirstVertex()); outEdge.setTarget(inEdge.getSecondVertex()); outEdge.setValue(NullValue.getInstance()); // flip vertices if first degree is larger than second degree. if (inEdge.getFirstDegree() > inEdge.getSecondDegree()) { outEdge = outEdge.reverse(); } // return edge return outEdge; } }
@Override public Edge<K, NullValue> map(EdgeWithDegrees<K> inEdge) throws Exception { // copy vertices to simple edge outEdge.setSource(inEdge.getFirstVertex()); outEdge.setTarget(inEdge.getSecondVertex()); outEdge.setValue(NullValue.getInstance()); // flip vertices if first degree is larger than second degree. if (inEdge.getFirstDegree() > inEdge.getSecondDegree()) { outEdge = outEdge.reverse(); } // return edge return outEdge; } }
@Override public Edge<K, NullValue> map(EdgeWithDegrees<K> inEdge) throws Exception { // copy vertices to simple edge outEdge.setSource(inEdge.getFirstVertex()); outEdge.setTarget(inEdge.getSecondVertex()); outEdge.setValue(NullValue.getInstance()); // flip vertices if first degree is larger than second degree. if (inEdge.getFirstDegree() > inEdge.getSecondDegree()) { outEdge = outEdge.reverse(); } // return edge return outEdge; } }