Examples with Node org.gephi.graph.api.Node used on opensource projects

Example 6 with Node

use of org.gephi.graph.api.Node in project gephi by gephi.

the class RandomLayout method goAlgo.

@Override
public void goAlgo() {
    graph = graphModel.getGraphVisible();
    graph.readLock();
    try {
        for (Node n : graph.getNodes()) {
            n.setX((float) (-size / 2 + size * random.nextDouble()));
            n.setY((float) (-size / 2 + size * random.nextDouble()));
        }
        converged = true;
    } finally {
        graph.readUnlockAll();
    }
}

Example 7 with Node

use of org.gephi.graph.api.Node in project gephi by gephi.

the class DegreeRankingImpl method refresh.

@Override
protected void refresh() {
    if (graph.getNodeCount() > 0) {
        int minV = Integer.MAX_VALUE;
        int maxV = Integer.MIN_VALUE;
        for (Node n : graph.getNodes()) {
            int degree = graph.getDegree(n);
            minV = Math.min(degree, minV);
            maxV = Math.max(degree, maxV);
        }
        min = minV;
        max = maxV;
    }
}

Example 8 with Node

use of org.gephi.graph.api.Node in project gephi by gephi.

the class InDegreeRankingImpl method refresh.

@Override
protected void refresh() {
    if (graph.getNodeCount() > 0) {
        int minV = Integer.MAX_VALUE;
        int maxV = Integer.MIN_VALUE;
        for (Node n : graph.getNodes()) {
            int degree = graph.getInDegree(n);
            minV = Math.min(degree, minV);
            maxV = Math.max(degree, maxV);
        }
        min = minV;
        max = maxV;
    }
}

Example 9 with Node

use of org.gephi.graph.api.Node in project gephi by gephi.

the class OutDegreeRankingImpl method refresh.

@Override
protected void refresh() {
    if (graph.getNodeCount() > 0) {
        int minV = Integer.MAX_VALUE;
        int maxV = Integer.MIN_VALUE;
        for (Node n : graph.getNodes()) {
            int degree = graph.getOutDegree(n);
            minV = Math.min(degree, minV);
            maxV = Math.max(degree, maxV);
        }
        min = minV;
        max = maxV;
    }
}

Example 10 with Node

use of org.gephi.graph.api.Node in project gephi by gephi.

the class AbstractShortestPathAlgorithm method relax.

protected boolean relax(Edge edge) {
    Node source = edge.getSource();
    Node target = edge.getTarget();
    double distSource = distances.get(source);
    double distTarget = distances.get(target);
    double weight = edgeWeight(edge);
    double sourceWeight = distSource + weight;
    if (sourceWeight < distTarget) {
        distances.put(target, sourceWeight);
        maxDistance = Math.max(maxDistance, sourceWeight);
        return true;
    } else {
        return false;
    }
}