org.nongnu.multigraph.metrics

Class TraversalMetrics

java.lang.Object

org.nongnu.multigraph.metrics.TraversalMetrics

public class TraversalMetrics
extends java.lang.Object

Return

Author:

paul

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static interface	TraversalMetrics.graph_traversor<N,E> action callback interface, for each node of a graph
static interface	TraversalMetrics.node_test<N>
class	TraversalMetrics.traversor_degree_distribution<N,E>

Constructor Summary

Constructors

Constructor and Description
TraversalMetrics()

Method Summary

Modifier and Type	Method and Description
static <N,E> int	count(Graph<N,E> graph, TraversalMetrics.node_test<N> t) Traverse the graph and count those nodes which are accepted by the node_test callback.
static <N,E> int[]	degree_distribution(Graph<N,E> graph) Traverse the Graph and create a histogram of the distribution of nodal out-degree.
static <N,E> int	edges(Graph<N,E> graph) Traverse the graph and count the number of edges.
static <N,E> dmap<N>	FloydWarshal(Graph<N,E> graph)
static <N,E> float[]	norm_degree_distribution(Graph<N,E> graph) Traverse the Graph and create a histogram of the normalised distribution of nodal out-degree.
static <N,E> java.util.Map<java.lang.String,java.lang.Double>	stats(dmap<N> dmap, Graph<N,E> graph)
static <N,E> java.util.Map<java.lang.String,java.lang.Double>	stats(Graph<N,E> graph)
static <N,E> void	traverse_graph(Graph<N,E> graph, TraversalMetrics.graph_traversor<N,E> gt) Simple convenience function to traverse a graph with the given traversor.
static <N,E> void	traverse_graph(Graph<N,E> graph, TraversalMetrics.graph_traversor<N,E>[] gts) Simple convenience function to traverse a graph for each of the given traversors

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

TraversalMetrics

public TraversalMetrics()

Method Detail

traverse_graph

public static <N,E> void traverse_graph(Graph<N,E> graph,
                                        TraversalMetrics.graph_traversor<N,E> gt)

Simple convenience function to traverse a graph with the given traversor.

Type Parameters:

N -

E -

Parameters:

graph -

gt -

traverse_graph

public static <N,E> void traverse_graph(Graph<N,E> graph,
                                        TraversalMetrics.graph_traversor<N,E>[] gts)

Simple convenience function to traverse a graph for each of the given traversors

degree_distribution

public static <N,E> int[] degree_distribution(Graph<N,E> graph)

Traverse the Graph and create a histogram of the distribution of nodal out-degree.

Type Parameters:

N - The type of the nodes in the graph.

E - The type of the edges in the graph.

Parameters:

graph - The graph to traverse

Returns:

An integer array of the degree distribution, where the array indices correspond to the degree.

norm_degree_distribution

public static <N,E> float[] norm_degree_distribution(Graph<N,E> graph)

Traverse the Graph and create a histogram of the normalised distribution of nodal out-degree. I.e. the probability of a given degree, for that degree.

Type Parameters:

N - The type of the nodes in the graph.

E - The type of the edges in the graph.

Parameters:

graph - The graph to traverse

Returns:

An integer array of the degree distribution, where the array indices correspond to the degree.

count

public static <N,E> int count(Graph<N,E> graph,
                              TraversalMetrics.node_test<N> t)

Traverse the graph and count those nodes which are accepted by the node_test callback.

Type Parameters:

N - The type of the nodes in the graph.

E - The type of the edges in the graph.

Parameters:

graph - The graph to traverse

t - The boolean callback to apply to decide whether a node should be counted or not.

Returns:

The number of nodes which match the provided test.

edges

public static <N,E> int edges(Graph<N,E> graph)

Traverse the graph and count the number of edges.

FloydWarshal

public static <N,E> dmap<N> FloydWarshal(Graph<N,E> graph)

stats

public static <N,E> java.util.Map<java.lang.String,java.lang.Double> stats(Graph<N,E> graph)

stats

public static <N,E> java.util.Map<java.lang.String,java.lang.Double> stats(dmap<N> dmap,
                                                                           Graph<N,E> graph)