info.debatty.java.graphs

Class Graph<T>

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<Node<T>,NeighborList>

info.debatty.java.graphs.Graph<T>

Type Parameters:

T - The type of nodes value

All Implemented Interfaces:

Serializable, Cloneable, Map<Node<T>,NeighborList>

public class Graph<T>
extends HashMap<Node<T>,NeighborList>

k-nn graph, represented as a mapping node => neighborlist

Author:

Thibault Debatty

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class java.util.AbstractMap

AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>

Constructor Summary

Constructors

Constructor and Description
Graph()
Graph(int n)

Method Summary

Methods

Modifier and Type	Method and Description
ArrayList<Graph<T>>	connectedComponents() Split the graph in connected components (usually you will first prune the graph to remove "weak" edges).
NeighborList	get(Node node) Get the neighborlist of this node
void	prune(double threshold) Remove from the graph all edges with a similarity lower than threshold
NeighborList	search(Node<T> Q, int K, int R, int T, int E, SimilarityInterface<T> rho, boolean debug)
void	writeGEXF(String filename) Writes the graph as a GEXF file (to be used in Gephi, for example)

Methods inherited from class java.util.HashMap

clear, clone, containsKey, containsValue, entrySet, get, isEmpty, keySet, put, putAll, remove, size, values

Methods inherited from class java.util.AbstractMap

equals, hashCode, toString

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map

equals, hashCode

Constructor Detail

Graph

public Graph(int n)

Graph

public Graph()

Method Detail

get

public NeighborList get(Node node)

Get the neighborlist of this node

Parameters:

node -

Returns:

the neighborlist of this node

prune

public void prune(double threshold)

Remove from the graph all edges with a similarity lower than threshold

Parameters:

threshold -

connectedComponents

public ArrayList<Graph<T>> connectedComponents()

Split the graph in connected components (usually you will first prune the graph to remove "weak" edges).

Returns:

search

public NeighborList search(Node<T> Q,
                  int K,
                  int R,
                  int T,
                  int E,
                  SimilarityInterface<T> rho,
                  boolean debug)

Parameters:

Q - query point

K - number of neighbors to find

R - number of random restarts

T - number of greedy steps

E - number of expansions

rho - similarity metric

Returns:

writeGEXF

public void writeGEXF(String filename)
               throws FileNotFoundException,
                      IOException

Writes the graph as a GEXF file (to be used in Gephi, for example)

Parameters:

filename -

Throws:

FileNotFoundException

IOException