public abstract class GraphUtil extends Object
| Constructor and Description |
|---|
GraphUtil() |
| Modifier and Type | Method and Description |
|---|---|
static net.sf.tweety.math.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 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 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.
|
public static 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 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 net.sf.tweety.math.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> Collection<List<T>> enumerateChordlessCircuits(Graph<T> g)
g - Copyright © 2018. All rights reserved.