E G I S T U V

E

Edge - Class in edu.ucdenver.ccp.esm
Definition of Edge for dependency graphs
Edge(Vertex, String, Vertex) - Constructor for class edu.ucdenver.ccp.esm.Edge
Construtor to initialize the class field
edu.ucdenver.ccp.esm - package edu.ucdenver.ccp.esm
 
ESM - Class in edu.ucdenver.ccp.esm
The Exact Subgraph Matching (ESM) algorithm Java implementation for subgraph isomorphism problems
ESM(DirectedGraph<Vertex, Edge>, DirectedGraph<Vertex, Edge>) - Constructor for class edu.ucdenver.ccp.esm.ESM
Constructor to initialize the subgraph and graph and specify the start node of the subgraph and the set of start nodes of the graph

G

getCompareForm() - Method in class edu.ucdenver.ccp.esm.Vertex
retrieve the comparison form of the node
getDependent() - Method in class edu.ucdenver.ccp.esm.Edge
retrieve dependent node of the edge
getGovernor() - Method in class edu.ucdenver.ccp.esm.Edge
retrieve governor node of the edge
getLabel() - Method in class edu.ucdenver.ccp.esm.Edge
retrieve edge label
getSubgraphMatchingMatches() - Method in class edu.ucdenver.ccp.esm.ESM
Retrieve specific matchings between the subgraph and the graph matching result is store in a map.
getTag() - Method in class edu.ucdenver.ccp.esm.Vertex
retrieve the POS tag of the node
getToken() - Method in class edu.ucdenver.ccp.esm.Vertex
retrieve original token of the node
getWord() - Method in class edu.ucdenver.ccp.esm.Vertex
retrieve the word of the node

I

isGraphIsomorphism() - Method in class edu.ucdenver.ccp.esm.ESM
Provide an additional function to determine if two graphs are isomorphic to each other based on the fact that if two graphs are subgraph isomorphic to each other, then they are isomorphic to each other
isSubgraphIsomorphism() - Method in class edu.ucdenver.ccp.esm.ESM
Check if the input subgraph is subsumed by the input graph

S

setCompareForm(String) - Method in class edu.ucdenver.ccp.esm.Vertex
set the comparison form of the node
setGeneralizedPOS(String) - Method in class edu.ucdenver.ccp.esm.Vertex
set the generalized POS tag of the node
setGraphStartNodes(List<Vertex>) - Method in class edu.ucdenver.ccp.esm.ESM
The default setting for choosing the set of start nodes for the graph is use all nodes in the graph as start nodes.
setLemma(String) - Method in class edu.ucdenver.ccp.esm.Vertex
set lemma for the node
setSubgraphStartNode(Vertex) - Method in class edu.ucdenver.ccp.esm.ESM
Instead of the default random start node, users can specify the start node for the subgraph

T

toString() - Method in class edu.ucdenver.ccp.esm.Edge
print edge content
toString() - Method in class edu.ucdenver.ccp.esm.Vertex
print node content

U

update(Vertex) - Method in class edu.ucdenver.ccp.esm.Vertex
use one node's information to update another node

V

Vertex - Class in edu.ucdenver.ccp.esm
Definition of Vertex for dependency graphs
Vertex(String) - Constructor for class edu.ucdenver.ccp.esm.Vertex
Construtor to initialize the class field
Vertex() - Constructor for class edu.ucdenver.ccp.esm.Vertex
default Construtor to initialize the class fields to empty

E G I S T U V

Copyright © 2012. All Rights Reserved.