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

Packages that use Endpoint

Package	Description
edu.cmu.tetrad.graph
edu.cmu.tetrad.search.utils	This package contains utility classes for causal graph search algorithms.

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)	getDistalEndpoint.
Endpoint	Dag.getEndpoint(Node node1, Node node2)	Returns the endpoint between two nodes in the graph.
final Endpoint	Edge.getEndpoint(Node node)	getProximalEndpoint.
Endpoint	EdgeListGraph.getEndpoint(Node node1, Node node2)	getEndpoint.
Endpoint	Graph.getEndpoint(Node node1, Node node2)	getEndpoint.
Endpoint	LagGraph.getEndpoint(Node node1, Node node2)	getEndpoint.
Endpoint	SemGraph.getEndpoint(Node node1, Node node2)	getEndpoint.
Endpoint	TimeLagGraph.getEndpoint(Node node1, Node node2)	Returns the endpoint between two nodes in the graph.
final Endpoint	Edge.getEndpoint1()	Getter for the field endpoint1.
final Endpoint	Edge.getEndpoint2()	Getter for the field endpoint2.
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)	Fully connects the given endpoint.
void	EdgeListGraph.fullyConnect(Endpoint endpoint)	Removes all edges from the graph and 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)	Removes all edges from the graph and fully connects it using #-# edges, where # is the given endpoint.
void	SemGraph.fullyConnect(Endpoint endpoint)	Removes all edges from the graph and fully connects it using #-# edges, where # is the given endpoint.
void	TimeLagGraph.fullyConnect(Endpoint endpoint)	Fully connects the given endpoint to all other endpoints in the graph.
static int	MisclassificationUtils.getIndex(Endpoint endpoint)	getIndex.
List<Node>	Dag.getNodesInTo(Node node, Endpoint n)	Retrieves a list of nodes in the given graph that have edges pointing into the specified node and endpoint.
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)	Nodes adjacent to the given node with the given proximal endpoint.
List<Node>	SemGraph.getNodesInTo(Node node, Endpoint endpoint)	Nodes adjacent to the given node with the given proximal endpoint.
List<Node>	TimeLagGraph.getNodesInTo(Node node, Endpoint endpoint)	Retrieves a list of nodes that have an incoming edge from a specific node and endpoint.
List<Node>	Dag.getNodesOutTo(Node node, Endpoint n)	Retrieves a list of nodes that have outgoing edges to a specified node and endpoint.
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)	Nodes adjacent to the given node with the given distal endpoint.
List<Node>	SemGraph.getNodesOutTo(Node node, Endpoint n)	Nodes adjacent to the given node with the given distal endpoint.
List<Node>	TimeLagGraph.getNodesOutTo(Node node, Endpoint endpoint)	Retrieves the list of nodes in a graph that have an outgoing edge to the given node and endpoint.
void	Dag.reorientAllWith(Endpoint endpoint)	Reorients all edges in a Directed Acyclic Graph (DAG) with a single endpoint type.
void	EdgeListGraph.reorientAllWith(Endpoint endpoint)	Reorients all edges in the graph with the given endpoint.
void	Graph.reorientAllWith(Endpoint endpoint)	Reorients all edges in the graph with the given endpoint.
void	LagGraph.reorientAllWith(Endpoint endpoint)	Reorients all edges in the graph with the given endpoint.
void	ReplicatingGraph.reorientAllWith(Endpoint ep)	Reorients all applicable edges in the graph to align with the specified endpoint.
void	SemGraph.reorientAllWith(Endpoint endpoint)	Reorients all edges in the graph with the given endpoint.
void	TimeLagGraph.reorientAllWith(Endpoint endpoint)	Reorients all edges in the graph to point towards the specified endpoint.
boolean	Dag.setEndpoint(Node from, Node to, Endpoint endPoint)	Sets the endpoint of a directed edge between two nodes in a graph.
boolean	EdgeListGraph.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	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)	Sets the endpoint type at the 'to' end of the edge from 'from' to 'to' to the given endpoint.
boolean	ReplicatingGraph.setEndpoint(Node from, Node to, Endpoint ep)	Mirrors endpoint changes across all policy-mirrored edges.
boolean	SemGraph.setEndpoint(Node node1, Node node2, Endpoint endpoint)	Sets the endpoint type at the 'to' end of the edge from 'from' to 'to' to the given endpoint.
boolean	TimeLagGraph.setEndpoint(Node from, Node to, Endpoint endPoint)	Sets the endpoint of an edge between two nodes in the graph.
final void	Edge.setEndpoint1(Endpoint e)	Setter for the field endpoint1.
final void	Edge.setEndpoint2(Endpoint e)	Setter for the field endpoint2.

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.
	Edge(Node node1, Node node2, Endpoint endpoint1, Endpoint endpoint2, boolean flipIfBackwards)	Constructs an Edge by specifying two nodes, their corresponding endpoints, and whether to flip the direction of the edge if it is pointing backwards.

Uses of Endpoint in edu.cmu.tetrad.search.utils

Methods in edu.cmu.tetrad.search.utils with parameters of type Endpoint

Modifier and Type	Method	Description
void	DefaultSetEndpointStrategy.setEndpoint(Graph graph, Node a, Node b, Endpoint endpoint)	Sets the endpoint of a graph given the two nodes and the desired endpoint.
void	SetEndpointStrategy.setEndpoint(Graph graph, Node a, Node b, Endpoint arrow)	Sets the endpoint of a graph given the two nodes and the desired endpoint.