public abstract class GraphUtil
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>> |
archiveHITSAuthRank
For archiving HITS rank values.
|
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>> |
archiveHITSHubRank |
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>> |
archivePageRank
For archiving page rank values.
|
Constructor and Description |
---|
GraphUtil() |
Modifier and Type | Method and Description |
---|---|
static ComplexNumber[] |
eigenvalues(Graph<? extends Node> g)
Computes the (real parts of the) Eigenvalues of the given graph.
|
static <T extends Node> |
enumerateChordlessCircuits(Graph<T> g)
Enumerates all chordless circuits of the given graph, i.e.
|
static <T extends Node> |
globalclusteringcoefficient(Graph<T> g)
Returns the global clustering coefficient of the graph (if it is directed it is interpreted
as an undirected version).
|
static java.lang.Double |
hitsRank(Graph<? extends Node> g,
Node n,
double precision,
boolean getAuth)
Computes the HITS rank of the given node in the given graph.
|
static boolean |
isIsomorphic(Graph<? extends Node> g1,
Graph<? extends Node> g2)
Checks whether the two graphs are isomorphic.
|
static java.lang.Double |
pageRank(Graph<? extends Node> g,
Node n,
double dampingFactor,
double precision)
Computes the PageRank of the given node in the given graph.
|
static <T extends Node> |
undirecteddiameter(Graph<T> g)
Returns the (undirected) diameter of the graph, i.e.
|
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>> archivePageRank
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>> archiveHITSAuthRank
public static java.lang.Double pageRank(Graph<? extends Node> g, Node n, double dampingFactor, double precision)
g
- a graphn
- a nodedampingFactor
- the damping factor for PageRankprecision
- the precision (smaller values mean higher precision)public static java.lang.Double hitsRank(Graph<? extends Node> g, Node n, double precision, boolean getAuth)
g
- a graphn
- a nodeprecision
- the precision (smaller values mean higher precision)public static ComplexNumber[] eigenvalues(Graph<? extends Node> g)
g
- some graphpublic static boolean isIsomorphic(Graph<? extends Node> g1, Graph<? extends Node> g2)
g1
- some graph.g2
- some graph.public static <T extends Node> int undirecteddiameter(Graph<T> g)
g
- some graphpublic static <T extends Node> double globalclusteringcoefficient(Graph<T> g)
g
- public static <T extends Node> java.util.Collection<java.util.List<T>> enumerateChordlessCircuits(Graph<T> g)
g
-