Uses of Enum Class
edu.cmu.tetrad.graph.Endpoint

Packages that use Endpoint

Package	Description
edu.cmu.tetrad.graph

Uses of Endpoint in edu.cmu.tetrad.graph

Methods in edu.cmu.tetrad.graph that return Endpoint

Modifier and Type	Method	Description
final Endpoint	Edge.getDistalEndpoint(Node node)
Endpoint	Dag.getEndpoint(Node node1, Node node2)
Endpoint	EdgeListGraph.getEndpoint(Node node1, Node node2)
Endpoint	Graph.getEndpoint(Node node1, Node node2)
Endpoint	LagGraph.getEndpoint(Node node1, Node node2)
Endpoint	SemGraph.getEndpoint(Node node1, Node node2)
Endpoint	TimeLagGraph.getEndpoint(Node node1, Node node2)
final Endpoint	Edge.getEndpoint1()
final Endpoint	Edge.getEndpoint2()
final Endpoint	Edge.getProximalEndpoint(Node node)
static Endpoint	Endpoint.valueOf(String name)	Returns the enum constant of this class with the specified name.
static Endpoint[]	Endpoint.values()	Returns an array containing the constants of this enum class, in the order they are declared.

Methods in edu.cmu.tetrad.graph with parameters of type Endpoint

Modifier and Type	Method	Description
void	Dag.fullyConnect(Endpoint endpoint)
void	EdgeListGraph.fullyConnect(Endpoint endpoint)	Resets the graph so that it is fully connects it using #-# edges, where # is the given endpoint.
void	Graph.fullyConnect(Endpoint endpoint)	Removes all edges from the graph and fully connects it using #-# edges, where # is the given endpoint.
void	LagGraph.fullyConnect(Endpoint endpoint)
void	SemGraph.fullyConnect(Endpoint endpoint)
void	TimeLagGraph.fullyConnect(Endpoint endpoint)
static int	MisclassificationUtils.getIndex(Endpoint endpoint)
List<Node>	Dag.getNodesInTo(Node node, Endpoint n)
List<Node>	EdgeListGraph.getNodesInTo(Node node, Endpoint endpoint)	Nodes adjacent to the given node with the given proximal endpoint.
List<Node>	Graph.getNodesInTo(Node node, Endpoint n)	Nodes adjacent to the given node with the given proximal endpoint.
List<Node>	LagGraph.getNodesInTo(Node node, Endpoint n)
List<Node>	SemGraph.getNodesInTo(Node node, Endpoint endpoint)
List<Node>	TimeLagGraph.getNodesInTo(Node node, Endpoint endpoint)
List<Node>	Dag.getNodesOutTo(Node node, Endpoint n)
List<Node>	EdgeListGraph.getNodesOutTo(Node node, Endpoint endpoint)	Nodes adjacent to the given node with the given distal endpoint.
List<Node>	Graph.getNodesOutTo(Node node, Endpoint n)	Nodes adjacent to the given node with the given distal endpoint.
List<Node>	LagGraph.getNodesOutTo(Node node, Endpoint n)
List<Node>	SemGraph.getNodesOutTo(Node node, Endpoint n)
List<Node>	TimeLagGraph.getNodesOutTo(Node node, Endpoint endpoint)
void	Dag.reorientAllWith(Endpoint endpoint)
void	EdgeListGraph.reorientAllWith(Endpoint endpoint)
void	Graph.reorientAllWith(Endpoint endpoint)	Reorients all edges in the graph with the given endpoint.
void	LagGraph.reorientAllWith(Endpoint endpoint)
void	SemGraph.reorientAllWith(Endpoint endpoint)
void	TimeLagGraph.reorientAllWith(Endpoint endpoint)
boolean	Dag.setEndpoint(Node from, Node to, Endpoint endPoint)
boolean	EdgeListGraph.setEndpoint(Node from, Node to, Endpoint endPoint)	If there is currently an edge from node1 to node2, sets the endpoint at node2 to the given endpoint; if there is no such edge, adds an edge --# where # is the given endpoint.
boolean	Graph.setEndpoint(Node from, Node to, Endpoint endPoint)	Sets the endpoint type at the 'to' end of the edge from 'from' to 'to' to the given endpoint.
boolean	LagGraph.setEndpoint(Node from, Node to, Endpoint endPoint)
boolean	SemGraph.setEndpoint(Node node1, Node node2, Endpoint endpoint)
boolean	TimeLagGraph.setEndpoint(Node from, Node to, Endpoint endPoint)
final void	Edge.setEndpoint1(Endpoint e)
final void	Edge.setEndpoint2(Endpoint e)

Constructors in edu.cmu.tetrad.graph with parameters of type Endpoint

Modifier	Constructor	Description
	Edge(Node node1, Node node2, Endpoint endpoint1, Endpoint endpoint2)	Constructs a new edge by specifying the nodes it connects and the endpoint types.