org.deeplearning4j.graph.models.deepwalk

Class GraphHuffman

java.lang.Object

org.deeplearning4j.graph.models.deepwalk.GraphHuffman

All Implemented Interfaces:

BinaryTree

public class GraphHuffman
extends Object
implements BinaryTree

An implementation of a Huffman tree specifically for graphs. Vertices in graph are indexed by an integer, 0 to nVertices-1

Constructor Summary

Constructors

Constructor and Description
GraphHuffman(int nVertices)
GraphHuffman(int nVertices, int maxCodeLength)

Method Summary

Modifier and Type	Method and Description
void	buildTree(int[] vertexDegree) Build the Huffman tree given an array of vertex degrees
long	getCode(int vertexNum)
int	getCodeLength(int vertexNum)
String	getCodeString(int vertexNum)
int[]	getPathInnerNodes(int vertexNum)

Methods inherited from class java.lang.Object

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

Constructor Detail

GraphHuffman

public GraphHuffman(int nVertices)

Parameters:

nVertices - number of vertices in the graph that this Huffman tree is being built for

GraphHuffman

public GraphHuffman(int nVertices,
                    int maxCodeLength)

Parameters:

nVertices - nVertices number of vertices in the graph that this Huffman tree is being built for

maxCodeLength - MAX_CODE_LENGTH for Huffman tree

Method Detail

buildTree

public void buildTree(int[] vertexDegree)

Build the Huffman tree given an array of vertex degrees

Parameters:

vertexDegree - vertexDegree[i] = degree of ith vertex

getCode

public long getCode(int vertexNum)

Specified by:

getCode in interface BinaryTree

getCodeLength

public int getCodeLength(int vertexNum)

Specified by:

getCodeLength in interface BinaryTree

getCodeString

public String getCodeString(int vertexNum)

Specified by:

getCodeString in interface BinaryTree

getPathInnerNodes

public int[] getPathInnerNodes(int vertexNum)

Specified by:

getPathInnerNodes in interface BinaryTree