graph.math

Class CzekanovskiDiceDistance<V extends Vertex,E extends Edge<V>>

java.lang.Object

graph.math.CzekanovskiDiceDistance<V,E>

public class CzekanovskiDiceDistance<V extends Vertex,E extends Edge<V>>
extends java.lang.Object

A class for calculating Czekanovski-Dice distances. With respect to Czekanovski-Dice distance, two vertices are close to each other if they have many common vertices.

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
CzekanovskiDiceDistance(Graph<V,E> graph)

Method Summary

Modifier and Type	Method and Description
java.util.Map<V,java.util.Map<V,java.lang.Double>>	calculateVerticeDistances() Calculates Czekanovski-Dice distances between all vertices of a graph
double	getDistance(V vi, V vj) Return the Czekanovski-Dice between two vertices

Methods inherited from class java.lang.Object

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

Constructor Detail

CzekanovskiDiceDistance

public CzekanovskiDiceDistance(Graph<V,E> graph)

Method Detail

calculateVerticeDistances

public java.util.Map<V,java.util.Map<V,java.lang.Double>> calculateVerticeDistances()

Calculates Czekanovski-Dice distances between all vertices of a graph

Returns:

A mapping of each vertex to a map of distances between itself and all other vertices of the graph

getDistance

public double getDistance(V vi,
                          V vj)

Return the Czekanovski-Dice between two vertices

Parameters:

vi - The first vertex

vj - The second vertex

Returns:

Czekanovski-Dice distance between vi and vj