com.sharethis.textrank

Class Node

java.lang.Object

com.sharethis.textrank.Node

All Implemented Interfaces:

Comparable<Node>

public class Node
extends Object
implements Comparable<Node>

Implements a node in the TextRank graph, denoting some noun or adjective morpheme.

Author:

paco@sharethis.com

Field Summary

Fields

Modifier and Type	Field and Description
Set<Node>	edges Public members.
String	key
boolean	marked
double	rank
NodeValue	value

Method Summary

Modifier and Type	Method and Description
static Node	buildNode(Graph graph, String key, NodeValue value) Factory method.
int	compareTo(Node that) Compare method for sort ordering.
void	connect(Node that) Connect two nodes with a bi-directional arc in the graph.
void	disconnect(Node that) Disconnect two nodes removing their bi-directional arc in the graph.
boolean	equals(Object obj)
String	getId() Create a unique identifier for this node, returned as a hex string.
int	hashCode()
double	maxNeighbor(double min, double coeff) Search nearest neighbors in WordNet subgraph to find the maximum rank of any adjacent SYNONYM synset.
void	serializeGraph(Set<String> entries) Traverse the graph, serializing out the nodes and edges.

Methods inherited from class java.lang.Object

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

Field Detail

edges

public Set<Node> edges

Public members.

rank

public double rank

key

public String key

marked

public boolean marked

value

public NodeValue value

Method Detail

compareTo

public int compareTo(Node that)

Compare method for sort ordering.

Specified by:

compareTo in interface Comparable<Node>

equals

public boolean equals(Object obj)

Overrides:

equals in class Object

hashCode

public int hashCode()

Overrides:

hashCode in class Object

connect

public void connect(Node that)

Connect two nodes with a bi-directional arc in the graph.

disconnect

public void disconnect(Node that)

Disconnect two nodes removing their bi-directional arc in the graph.

getId

public String getId()

Create a unique identifier for this node, returned as a hex string.

buildNode

public static Node buildNode(Graph graph,
                             String key,
                             NodeValue value)

Factory method.

maxNeighbor

public double maxNeighbor(double min,
                          double coeff)

Search nearest neighbors in WordNet subgraph to find the maximum rank of any adjacent SYNONYM synset.

serializeGraph

public void serializeGraph(Set<String> entries)

Traverse the graph, serializing out the nodes and edges.