Uses of Class
edu.ucdenver.ccp.esm.Vertex

Uses of Vertex in edu.ucdenver.ccp.esm
 

Methods in edu.ucdenver.ccp.esm that return Vertex
 Vertex Edge.getDependent()
          retrieve dependent node of the edge
 Vertex Edge.getGovernor()
          retrieve governor node of the edge
 

Methods in edu.ucdenver.ccp.esm that return types with arguments of type Vertex
 List<Map<Vertex,Vertex>> ESM.getSubgraphMatchingMatches()
          Retrieve specific matchings between the subgraph and the graph matching result is store in a map.
 List<Map<Vertex,Vertex>> ESM.getSubgraphMatchingMatches()
          Retrieve specific matchings between the subgraph and the graph matching result is store in a map.
 

Methods in edu.ucdenver.ccp.esm with parameters of type Vertex
 void ESM.setSubgraphStartNode(Vertex vertex)
          Instead of the default random start node, users can specify the start node for the subgraph
protected  void Vertex.update(Vertex target)
          use one node's information to update another node
 

Method parameters in edu.ucdenver.ccp.esm with type arguments of type Vertex
 void ESM.setGraphStartNodes(List<Vertex> vertices)
          The default setting for choosing the set of start nodes for the graph is use all nodes in the graph as start nodes.
 

Constructors in edu.ucdenver.ccp.esm with parameters of type Vertex
Edge(Vertex gov, String label, Vertex dep)
          Construtor to initialize the class field
 

Constructor parameters in edu.ucdenver.ccp.esm with type arguments of type Vertex
ESM(edu.uci.ics.jung.graph.DirectedGraph<Vertex,Edge> subgraph, edu.uci.ics.jung.graph.DirectedGraph<Vertex,Edge> graph)
          Constructor to initialize the subgraph and graph and specify the start node of the subgraph and the set of start nodes of the graph
ESM(edu.uci.ics.jung.graph.DirectedGraph<Vertex,Edge> subgraph, edu.uci.ics.jung.graph.DirectedGraph<Vertex,Edge> graph)
          Constructor to initialize the subgraph and graph and specify the start node of the subgraph and the set of start nodes of the graph
 



Copyright © 2012. All Rights Reserved.