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

Packages that use Graph

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.documentModel.representations
gr.demokritos.iit.jinsect.structs

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

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

class

SymbolicGraph Represents a graph of symbols of different character lengths.

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

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

class

DistributionGraph A graph with weighted edges mapped to distributions.

Uses of Graph in gr.demokritos.iit.jinsect

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

static java.util.List	utils.getIncomingEdges(Graph gGraph, salvo.jesus.graph.Vertex vTail) Gets the incoming edges to a given vertex in a directed graph.
static java.util.List	utils.getOutgoingEdges(Graph gGraph, salvo.jesus.graph.Vertex vHead) Gets the outgoing edges of a given vertex in a directed graph.
static java.lang.String	utils.graphToDot(Graph gTree, boolean bDirected) Renders a graph to its DOT representation (See GraphViz for more info on the format).
static java.lang.String	utils.graphToDot(Graph 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(Graph 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(Graph 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(Graph 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(Graph gGraph, java.lang.String sToFind) Looks up a vertex, based on its label, within a given graph.
static salvo.jesus.graph.Vertex	utils.locateVertexInGraph(Graph gGraph, salvo.jesus.graph.Vertex vToFind) Looks up a vertex in a given graph.

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

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

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

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

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

static java.util.ListIterator

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

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

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

class

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

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

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

protected Graph[]

DocumentNGramGraph.NGramGraphArray

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

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

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

void	DocumentGraph.createEdgesConnecting(Graph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, double dStartWeight, double dIncreaseWeight) Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes.
void	DocumentNGramGraph.createEdgesConnecting(Graph 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(Graph 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	DocumentNGramDistroGraph.createEdgesConnecting(Graph 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(Graph 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(Graph 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(Graph 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(Graph 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(Graph 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.
void	DocumentGraph.createWeightedEdgesConnecting(Graph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, double dStartWeight, double iNewWeight, double dDataImportance) Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes.

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

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

java.util.List	EdgeCachedLocator.getOutgoingEdges(Graph gGraph, salvo.jesus.graph.Vertex vHead) Gets the outgoing edges of a given vertex in a directed graph.
protected java.util.List	EdgeCachedLocator.getOutgoingEdgesUncached(Graph gGraph, salvo.jesus.graph.Vertex vHead) Uncached outgoing edge lookup.
salvo.jesus.graph.Edge	EdgeCachedLocator.locateDirectedEdgeInGraph(Graph 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(Graph 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(Graph gGraph, salvo.jesus.graph.Vertex vToFind) Looks up a vertex in a given graph.