for(E incomingEdge : mGraph.getInEdges(vertex)) for (V neighbor : mGraph.getIncidentVertices(incomingEdge))
for(E incomingEdge : mGraph.getInEdges(vertex)) for (V neighbor : mGraph.getIncidentVertices(incomingEdge))
ArrayList<V> incident = new ArrayList<V>(h.getIncidentVertices(e)); for (int i = 0; i < incident.size(); i++) for (int j = i+1; j < incident.size(); j++)
for (E incomingEdge : mGraph.getInEdges(vertex)) { for (V neighbor : mGraph .getIncidentVertices(incomingEdge)) { if (neighbor.equals(vertex))
ArrayList<V> incident = new ArrayList<V>(h.getIncidentVertices(e)); populateTarget(target, e, incident);
ArrayList<V> incident = new ArrayList<V>(h.getIncidentVertices(e)); for (int i = 0; i < incident.size(); i++) for (int j = i+1; j < incident.size(); j++)
ArrayList<V> incident = new ArrayList<V>(h.getIncidentVertices(e)); for (int i = 0; i < incident.size(); i++) { for (int j = i + 1; j < incident.size(); j++) {
for (E e : edges) { int incident_count = getAdjustedIncidentCount(e); for (V w : graph.getIncidentVertices(e)) { if (!w.equals(v) || hyperedges_are_self_loops) { double weight = getEdgeWeight(w, e).doubleValue()
for (V w : graph.getIncidentVertices(e))
/** * Updates the value for this vertex. Called by <code>step()</code>. */ @Override public double update(V v) { collectDisappearingPotential(v); double v_input = 0; for (E e : graph.getInEdges(v)) { // For graphs, the code below is equivalent to // V w = graph.getOpposite(v, e); // total_input += (getCurrentValue(w) * // getEdgeWeight(w,e).doubleValue()); // For hypergraphs, this divides the potential coming from w // by the number of vertices in the connecting edge e. int incident_count = getAdjustedIncidentCount(e); for (V w : graph.getIncidentVertices(e)) { if (!w.equals(v) || hyperedges_are_self_loops) { v_input += (getCurrentValue(w) * getEdgeWeight(w, e).doubleValue() / incident_count); } } } // modify total_input according to alpha double new_value = alpha > 0 ? v_input * (1 - alpha) + getVertexPrior(v) * alpha : v_input; setOutputValue(v, new_value); return Math.abs(getCurrentValue(v) - new_value); }
ArrayList<V> incident = new ArrayList<V>(h.getIncidentVertices(e)); populateTarget(target, e, incident);
for (E e : graph.getInEdges(v)) { int incident_count = getAdjustedIncidentCount(e); for (V w : graph.getIncidentVertices(e)) { if (!w.equals(v) || hyperedges_are_self_loops) { v_auth += (getCurrentValue(w).hub for (E e : graph.getOutEdges(v)) { int incident_count = getAdjustedIncidentCount(e); for (V w : graph.getIncidentVertices(e)) { if (!w.equals(v) || hyperedges_are_self_loops) { v_hub += (getCurrentValue(w).authority
for (V w : graph.getIncidentVertices(e))
for (V w : graph.getIncidentVertices(e))
for (V w : graph.getIncidentVertices(e)) for (V w : graph.getIncidentVertices(e))
for (V w : graph.getIncidentVertices(e)) for (V w : graph.getIncidentVertices(e))
ArrayList<V> incident = new ArrayList<V>(h.getIncidentVertices(e)); populateTarget(target, e, incident);
for (V w : graph.getIncidentVertices(e))
for (V w : graph.getIncidentVertices(e))
for (V w : graph.getIncidentVertices(e)) { if (!w.equals(v) || hyperedges_are_self_loops) { v_input += (getCurrentValue(w)