Uses of Class
gr.demokritos.iit.jinsect.structs.UniqueVertexGraph

Packages that use UniqueVertexGraph

gr.demokritos.iit.conceptualIndex.documentModel
gr.demokritos.iit.conceptualIndex.structs
gr.demokritos.iit.jinsect
gr.demokritos.iit.jinsect.algorithms.clustering
gr.demokritos.iit.jinsect.casc.console
gr.demokritos.iit.jinsect.casc.structs
gr.demokritos.iit.jinsect.console
gr.demokritos.iit.jinsect.documentModel.representations
gr.demokritos.iit.jinsect.indexing
gr.demokritos.iit.jinsect.structs

Uses of UniqueVertexGraph in gr.demokritos.iit.conceptualIndex.documentModel

Subclasses of UniqueVertexGraph in gr.demokritos.iit.conceptualIndex.documentModel

class

SymbolicGraph Represents a graph of symbols of different character lengths.

Uses of UniqueVertexGraph in gr.demokritos.iit.conceptualIndex.structs

Subclasses of UniqueVertexGraph in gr.demokritos.iit.conceptualIndex.structs

class

DistributionGraph A graph with weighted edges mapped to distributions.

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect

Methods in gr.demokritos.iit.jinsect with parameters of type UniqueVertexGraph

static java.util.List	utils.getAdjacentIncomingVertices(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vTail) Gets the adjacent vertices of incoming edges of a given vertex in a directed graph.
static java.util.List	utils.getIncomingEdges(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vTail) Gets the incoming edges to a given vertex in a directed graph.
static java.util.List	utils.getOutgoingAdjacentVertices(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead) Gets the adjacent vertices of outgoing edges from a given vertex in a graph.
static java.util.List	utils.getOutgoingEdges(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead) Gets the outgoing edges of a given vertex in a graph.
static java.lang.String	utils.graphToDot(UniqueVertexGraph gTree, boolean bDirected) Renders a graph to its DOT representation (See GraphViz for more info on the format).
static java.lang.String	utils.graphToDot(UniqueVertexGraph gTree, boolean bDirected, java.util.Map hEdgeDistros) Renders a graph to its DOT representation (See GraphViz for more info on the format).
static salvo.jesus.graph.Edge	utils.locateDirectedEdgeInGraph(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead, salvo.jesus.graph.Vertex vTail) Looks up a given directed edge in a selected graph.
static salvo.jesus.graph.Edge	utils.locateEdgeInGraph(UniqueVertexGraph gGraph, java.lang.String sHead, java.lang.String sTail) Looks up a given (undirected) edge in a selected graph.
static salvo.jesus.graph.Edge	utils.locateEdgeInGraph(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead, salvo.jesus.graph.Vertex vTail) Looks up a given (undirected) edge in a selected graph.
static salvo.jesus.graph.Vertex	utils.locateVertexInGraph(UniqueVertexGraph gGraph, java.lang.String sToFind) Looks up a vertex, based on its label, within a given graph.
static salvo.jesus.graph.Vertex	utils.locateVertexInGraph(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vToFind) Looks up a vertex in a given graph.

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect.algorithms.clustering

Methods in gr.demokritos.iit.jinsect.algorithms.clustering that return UniqueVertexGraph

UniqueVertexGraph	IClusterer.getHierarchy() Returns the (calculated) hierarchy of the clusters.
UniqueVertexGraph	SingleLinkClusterer.getHierarchy()

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect.casc.console

Methods in gr.demokritos.iit.jinsect.casc.console with parameters of type UniqueVertexGraph

static java.util.ListIterator

casc.getEdgeIteratorByWeight(UniqueVertexGraph g) Returns a list iterator object that runs through the edge set of a given graph in weight ascending order.

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect.casc.structs

Subclasses of UniqueVertexGraph in gr.demokritos.iit.jinsect.casc.structs

class

CASCGraph Represents a graph of named documents, allowing intermediate unnamed (latent) vertices.

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect.console

Methods in gr.demokritos.iit.jinsect.console with parameters of type UniqueVertexGraph

static java.lang.String

DOTGraphRepoExporter.getStats(UniqueVertexGraph uvGraph)

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect.documentModel.representations

Fields in gr.demokritos.iit.jinsect.documentModel.representations declared as UniqueVertexGraph

protected UniqueVertexGraph[]

DocumentNGramGraph.NGramGraphArray

Methods in gr.demokritos.iit.jinsect.documentModel.representations that return UniqueVertexGraph

UniqueVertexGraph	DocumentNGramGraph.getGraphLevel(int iIndex) Returns graph with M-based index
UniqueVertexGraph	DocumentNGramGraph.getGraphLevelByNGramSize(int iNGramSize) Returns graph with n-gram-size-based index

Methods in gr.demokritos.iit.jinsect.documentModel.representations with parameters of type UniqueVertexGraph

void	DocumentNGramDistroGraph.createEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in a graph connecting a selected node to each node in a list of other nodes.
void	DocumentNGramGaussNormGraph.createEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes.
void	DocumentNGramGaussNormSymWinGraph.createEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes.
void	DocumentNGramGraph.createEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes.
void	DocumentNGramGaussNormSymWinGraph.createSymEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in [gGraph] connecting [sStartNode] to each node in the [lOtherNodes] list of nodes, as well as other nodes to [sBaseNode].
void	DocumentNGramSymWinDistroGraph.createSymEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in [gGraph] connecting [sStartNode] to each node in the [lOtherNodes] list of nodes, as well as other nodes to [sBaseNode].
void	DocumentNGramSymWinGraph.createSymEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in [gGraph] connecting [sStartNode] to each node in the [lOtherNodes] list of nodes, as well as other nodes to [sBaseNode].
void	DocumentNGramGraph.createWeightedEdgesConnecting(UniqueVertexGraph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, double dStartWeight, double dNewWeight, double dDataImportance) Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes.

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect.indexing

Fields in gr.demokritos.iit.jinsect.indexing declared as UniqueVertexGraph

protected UniqueVertexGraph

SimilarityBasedIndex.Hierarchy

Uses of UniqueVertexGraph in gr.demokritos.iit.jinsect.structs

Methods in gr.demokritos.iit.jinsect.structs with parameters of type UniqueVertexGraph

java.util.List	EdgeCachedLocator.getOutgoingEdges(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead) Gets the outgoing edges of a given vertex in a directed graph.
protected java.util.List	EdgeCachedLocator.getOutgoingEdgesUncached(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead) Uncached outgoing edge lookup.
salvo.jesus.graph.Edge	EdgeCachedLocator.locateDirectedEdgeInGraph(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead, salvo.jesus.graph.Vertex vTail) Looks up a given directed edge in a selected graph.
salvo.jesus.graph.Edge	EdgeCachedLocator.locateEdgeInGraph(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vHead, salvo.jesus.graph.Vertex vTail) Looks up a given (undirected) edge in a selected graph.
salvo.jesus.graph.Vertex	EdgeCachedLocator.locateVertexInGraph(UniqueVertexGraph gGraph, salvo.jesus.graph.Vertex vToFind) Looks up a vertex in a given graph.