Uses of Class
info.debatty.java.graphs.Node

Packages that use Node

Package	Description
info.debatty.java.graphs
info.debatty.java.graphs.build

Uses of Node in info.debatty.java.graphs

Fields in info.debatty.java.graphs declared as Node

Modifier and Type	Field and Description
Node	Edge.n1
Node	Edge.n2
Node	Neighbor.node

Methods in info.debatty.java.graphs that return types with arguments of type Node

Modifier and Type	Method and Description
LinkedList<Node>	Dijkstra.getPath(Node target) Return the path from the source to the selected target

Methods in info.debatty.java.graphs with parameters of type Node

Modifier and Type	Method and Description
NeighborList	Graph.get(Node node) Get the neighborlist of this node
LinkedList<Node>	Dijkstra.getPath(Node target) Return the path from the source to the selected target

Method parameters in info.debatty.java.graphs with type arguments of type Node

Modifier and Type	Method and Description
static ArrayList<Edge>	NeighborList.Convert2Edges(HashMap<Node,NeighborList> graph)

Constructors in info.debatty.java.graphs with parameters of type Node

Constructor and Description
Dijkstra(Graph graph, Node source) Compute the shortest path from source node to every other node in the graph.
Edge(Node n1, Node n2, double weight)
Edge(Node n1, Node n2, double weight)
Neighbor(Node node, double similarity)

Uses of Node in info.debatty.java.graphs.build

Methods in info.debatty.java.graphs.build that return types with arguments of type Node

Modifier and Type	Method and Description
protected ArrayList<Node>	NNDescent.PickFalses(NeighborList neighborList)
protected ArrayList<Node>	NNDescent.PickTruesAndMark(NeighborList neighborList) pick new neighbors with a probability of rho, and mark them as false
static ArrayList<Node<String>>	GraphBuilder.readFile(String path)
protected HashMap<Node<T>,ArrayList>	NNDescent.Reverse(List<Node<T>> nodes, HashMap<Node<T>,ArrayList> lists)
protected ArrayList<Node>	NNDescent.Sample(ArrayList<Node> nodes, int count) Reverse NN array R[v] is the list of elements (u) for which v is a neighbor (v is in B[u])
protected ArrayList<Node>	NNDescent.Union(ArrayList<Node> l1, ArrayList<Node> l2)

Methods in info.debatty.java.graphs.build with parameters of type Node

Modifier and Type	Method and Description
protected NeighborList	NNDescent.RandomNeighborList(List<Node<T>> nodes, Node for_node)
protected double	NNDescent.Similarity(Node n1, Node n2)
protected double	NNDescent.Similarity(Node n1, Node n2)
protected int	NNDescent.UpdateNL(NeighborList nl, Node n, double similarity)

Method parameters in info.debatty.java.graphs.build with type arguments of type Node

Modifier and Type	Method and Description
protected Graph<t>	Brute._computeGraph(List<Node<t>> nodes)
protected abstract Graph<t>	GraphBuilder._computeGraph(List<Node<t>> nodes)
protected Graph<T>	ThreadedNNDescent._computeGraph(List<Node<T>> nodes)
protected Graph<T>	PartitioningGraphBuilder._computeGraph(List<Node<T>> nodes)
protected Graph<T>	NNDescent._computeGraph(List<Node<T>> nodes)
protected List<Node<String>>[]	NNCTPH._partition(List<Node<String>> nodes)
protected abstract List<Node<T>>[]	PartitioningGraphBuilder._partition(List<Node<T>> nodes)
Graph<t>	GraphBuilder.computeGraph(List<Node<t>> nodes)
protected Graph<T>	NNDescent.MakeFullyLinked(List<Node<T>> nodes)
protected NeighborList	NNDescent.RandomNeighborList(List<Node<T>> nodes, Node for_node)
protected HashMap<Node<T>,ArrayList>	NNDescent.Reverse(List<Node<T>> nodes, HashMap<Node<T>,ArrayList> lists)
protected HashMap<Node<T>,ArrayList>	NNDescent.Reverse(List<Node<T>> nodes, HashMap<Node<T>,ArrayList> lists)
protected ArrayList<Node>	NNDescent.Sample(ArrayList<Node> nodes, int count) Reverse NN array R[v] is the list of elements (u) for which v is a neighbor (v is in B[u])
void	GraphBuilder.test(List<Node<t>> nodes) Build the approximate graph, then use brute-force to build the exact graph and compare the results
protected ArrayList<Node>	NNDescent.Union(ArrayList<Node> l1, ArrayList<Node> l2)
protected ArrayList<Node>	NNDescent.Union(ArrayList<Node> l1, ArrayList<Node> l2)