@Override public String toPrintableString() { NumberFormat nf = NumberFormat.getInstance(); // format for very small fractional numbers NumberFormat ff = NumberFormat.getInstance(); ff.setMaximumFractionDigits(8); return "vertex count: " + nf.format(vertexCount) + "; edge count: " + nf.format(getNumberOfEdges()) + "; unidirectional edge count: " + nf.format(unidirectionalEdgeCount) + "; bidirectional edge count: " + nf.format(bidirectionalEdgeCount) + "; average degree: " + nf.format(getAverageDegree()) + "; density: " + ff.format(getDensity()) + "; triplet count: " + nf.format(tripletCount) + "; maximum degree: " + nf.format(maximumDegree) + "; maximum out degree: " + nf.format(maximumOutDegree) + "; maximum in degree: " + nf.format(maximumInDegree) + "; maximum triplets: " + nf.format(maximumTriplets); }
@Override public String toPrintableString() { NumberFormat nf = NumberFormat.getInstance(); // format for very small fractional numbers NumberFormat ff = NumberFormat.getInstance(); ff.setMaximumFractionDigits(8); return "vertex count: " + nf.format(vertexCount) + "; edge count: " + nf.format(getNumberOfEdges()) + "; unidirectional edge count: " + nf.format(unidirectionalEdgeCount) + "; bidirectional edge count: " + nf.format(bidirectionalEdgeCount) + "; average degree: " + nf.format(getAverageDegree()) + "; density: " + ff.format(getDensity()) + "; triplet count: " + nf.format(tripletCount) + "; maximum degree: " + nf.format(maximumDegree) + "; maximum out degree: " + nf.format(maximumOutDegree) + "; maximum in degree: " + nf.format(maximumInDegree) + "; maximum triplets: " + nf.format(maximumTriplets); }
@Override public String toPrintableString() { NumberFormat nf = NumberFormat.getInstance(); // format for very small fractional numbers NumberFormat ff = NumberFormat.getInstance(); ff.setMaximumFractionDigits(8); return "vertex count: " + nf.format(vertexCount) + "; edge count: " + nf.format(getNumberOfEdges()) + "; unidirectional edge count: " + nf.format(unidirectionalEdgeCount) + "; bidirectional edge count: " + nf.format(bidirectionalEdgeCount) + "; average degree: " + nf.format(getAverageDegree()) + "; density: " + ff.format(getDensity()) + "; triplet count: " + nf.format(tripletCount) + "; maximum degree: " + nf.format(maximumDegree) + "; maximum out degree: " + nf.format(maximumOutDegree) + "; maximum in degree: " + nf.format(maximumInDegree) + "; maximum triplets: " + nf.format(maximumTriplets); }
@Override public String toPrintableString() { NumberFormat nf = NumberFormat.getInstance(); // format for very small fractional numbers NumberFormat ff = NumberFormat.getInstance(); ff.setMaximumFractionDigits(8); return "vertex count: " + nf.format(vertexCount) + "; edge count: " + nf.format(getNumberOfEdges()) + "; unidirectional edge count: " + nf.format(unidirectionalEdgeCount) + "; bidirectional edge count: " + nf.format(bidirectionalEdgeCount) + "; average degree: " + nf.format(getAverageDegree()) + "; density: " + ff.format(getDensity()) + "; triplet count: " + nf.format(tripletCount) + "; maximum degree: " + nf.format(maximumDegree) + "; maximum out degree: " + nf.format(maximumOutDegree) + "; maximum in degree: " + nf.format(maximumInDegree) + "; maximum triplets: " + nf.format(maximumTriplets); }
/** * Get the density, the ratio of actual to potential edges between vertices. * * <p>A result of {@code Float.NaN} is returned for a graph with fewer than * two vertices for which the number of edges is zero. * * @return density */ public double getDensity() { return vertexCount <= 1 ? Double.NaN : getNumberOfEdges() / (double) (vertexCount * (vertexCount - 1)); }
/** * Get the average degree, the average number of in- plus out-edges per vertex. * * <p>A result of {@code Float.NaN} is returned for an empty graph for * which both the number of edges and number of vertices is zero. * * @return average degree */ public double getAverageDegree() { return vertexCount == 0 ? Double.NaN : getNumberOfEdges() / (double) vertexCount; }
/** * Get the density, the ratio of actual to potential edges between vertices. * * <p>A result of {@code Float.NaN} is returned for a graph with fewer than * two vertices for which the number of edges is zero. * * @return density */ public double getDensity() { return vertexCount <= 1 ? Double.NaN : getNumberOfEdges() / (double) (vertexCount * (vertexCount - 1)); }
/** * Get the average degree, the average number of in- plus out-edges per vertex. * * <p>A result of {@code Float.NaN} is returned for an empty graph for * which both the number of edges and number of vertices is zero. * * @return average degree */ public double getAverageDegree() { return vertexCount == 0 ? Double.NaN : getNumberOfEdges() / (double) vertexCount; }
/** * Get the density, the ratio of actual to potential edges between vertices. * * A result of {@code Float.NaN} is returned for a graph with fewer than * two vertices for which the number of edges is zero. * * @return density */ public double getDensity() { return vertexCount <= 1 ? Double.NaN : getNumberOfEdges() / (double)(vertexCount*(vertexCount-1)); }
/** * Get the average degree, the average number of in- plus out-edges per vertex. * * A result of {@code Float.NaN} is returned for an empty graph for * which both the number of edges and number of vertices is zero. * * @return average degree */ public double getAverageDegree() { return vertexCount == 0 ? Double.NaN : getNumberOfEdges() / (double)vertexCount; }
/** * Get the density, the ratio of actual to potential edges between vertices. * * <p>A result of {@code Float.NaN} is returned for a graph with fewer than * two vertices for which the number of edges is zero. * * @return density */ public double getDensity() { return vertexCount <= 1 ? Double.NaN : getNumberOfEdges() / (double) (vertexCount * (vertexCount - 1)); }
/** * Get the average degree, the average number of in- plus out-edges per vertex. * * <p>A result of {@code Float.NaN} is returned for an empty graph for * which both the number of edges and number of vertices is zero. * * @return average degree */ public double getAverageDegree() { return vertexCount == 0 ? Double.NaN : getNumberOfEdges() / (double) vertexCount; }