Uses of Class
edu.cmu.tetrad.graph.Edge

Packages that use Edge

Package	Description
edu.cmu.tetrad.algcomparison.statistic
edu.cmu.tetrad.graph
edu.cmu.tetrad.search	Contains classes for searching for (mostly structural) causal models given data.
edu.cmu.tetrad.search.utils	Contains some utility classes for search algorithms.
edu.cmu.tetrad.search.work_in_progress	Contains some classes that aren't ready for prime time.
edu.cmu.tetrad.sem
edu.cmu.tetrad.simulation
edu.cmu.tetrad.util

Uses of Edge in edu.cmu.tetrad.algcomparison.statistic

Methods in edu.cmu.tetrad.algcomparison.statistic with parameters of type Edge

Modifier and Type	Method	Description
static boolean	CommonAncestorTruePositiveBidirected.existsCommonAncestor(Graph trueGraph, Edge edge)
static boolean	NumCommonMeasuredAncestorBidirected.existsCommonAncestor(Graph trueGraph, Edge edge)
static boolean	LatentCommonAncestorTruePositiveBidirected.existsLatentCommonAncestor(Graph trueGraph, Edge edge)

Uses of Edge in edu.cmu.tetrad.graph

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

Modifier and Type	Method	Description
static Edge	Edges.bidirectedEdge(Node nodeA, Node nodeB)	Constructs a new bidirected edge from nodeA to nodeB (<->).
static Edge	Edges.directedEdge(Node nodeA, Node nodeB)	Constructs a new directed edge from nodeA to nodeB (-->).
Edge	Dag.getDirectedEdge(Node node1, Node node2)
Edge	EdgeListGraph.getDirectedEdge(Node node1, Node node2)
Edge	Graph.getDirectedEdge(Node node1, Node node2)
Edge	LagGraph.getDirectedEdge(Node node1, Node node2)
Edge	SemGraph.getDirectedEdge(Node node1, Node node2)
Edge	TimeLagGraph.getDirectedEdge(Node node1, Node node2)
Edge	Dag.getEdge(Node node1, Node node2)
Edge	EdgeListGraph.getEdge(Node node1, Node node2)
Edge	Graph.getEdge(Node node1, Node node2)
Edge	LagGraph.getEdge(Node node1, Node node2)
Edge	SemGraph.getEdge(Node node1, Node node2)
Edge	TimeLagGraph.getEdge(Node node1, Node node2)
static Edge	Edges.nondirectedEdge(Node nodeA, Node nodeB)	Constructs a new nondirected edge from nodeA to nodeB (o-o).
static Edge	Edges.partiallyOrientedEdge(Node nodeA, Node nodeB)	Constructs a new partially oriented edge from nodeA to nodeB (o->).
Edge	Edge.reverse()
static Edge	Edge.serializableInstance()	Generates a simple exemplar of this class to test serialization.
static Edge	Edges.undirectedEdge(Node nodeA, Node nodeB)	Constructs a new undirected edge from nodeA to nodeB (--).

Methods in edu.cmu.tetrad.graph that return types with arguments of type Edge

Modifier and Type	Method	Description
static Set<Edge>	MisclassificationUtils.convertNodes(Set<Edge> edges, List<Node> newVariables)
Set<Edge>	Dag.getEdges()
List<Edge>	Dag.getEdges(Node node)
List<Edge>	Dag.getEdges(Node node1, Node node2)
Set<Edge>	EdgeListGraph.getEdges()
List<Edge>	EdgeListGraph.getEdges(Node node)
List<Edge>	EdgeListGraph.getEdges(Node node1, Node node2)
Set<Edge>	Graph.getEdges()
List<Edge>	Graph.getEdges(Node node)
List<Edge>	Graph.getEdges(Node node1, Node node2)
Set<Edge>	LagGraph.getEdges()
List<Edge>	LagGraph.getEdges(Node node)
List<Edge>	LagGraph.getEdges(Node node1, Node node2)
Set<Edge>	SemGraph.getEdges()
List<Edge>	SemGraph.getEdges(Node node)
List<Edge>	SemGraph.getEdges(Node node1, Node node2)
Set<Edge>	TimeLagGraph.getEdges()
List<Edge>	TimeLagGraph.getEdges(Node node)
List<Edge>	TimeLagGraph.getEdges(Node node1, Node node2)
List<Edge>	GraphUtils.GraphComparison.getEdgesAdded()
List<Edge>	GraphUtils.GraphComparison.getEdgesRemoved()

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

Modifier and Type	Method	Description
boolean	Dag.addEdge(Edge edge)
boolean	EdgeListGraph.addEdge(Edge edge)	Adds an edge to the graph.
boolean	Graph.addEdge(Edge edge)	Adds the specified edge to the graph, provided it is not already in the graph.
boolean	LagGraph.addEdge(Edge edge)
boolean	SemGraph.addEdge(Edge edge)
boolean	TimeLagGraph.addEdge(Edge edge)
int	Edge.compareTo(Edge _edge)
static boolean	GraphUtils.compatible(Edge edge1, Edge edge2)
boolean	Dag.containsEdge(Edge edge)
boolean	EdgeListGraph.containsEdge(Edge edge)	Determines if the graph contains a particular edge.
boolean	Graph.containsEdge(Edge edge)	Determines whether this graph contains the given edge.
boolean	LagGraph.containsEdge(Edge edge)
boolean	SemGraph.containsEdge(Edge edge)
boolean	TimeLagGraph.containsEdge(Edge edge)
boolean	Paths.defVisible(Edge edge)	added by ekorber, 2004/06/11
static Node	Edges.getDirectedEdgeHead(Edge edge)	For a directed edge, returns the node adjacent to the arrow endpoint.
static Node	Edges.getDirectedEdgeTail(Edge edge)	For a directed edge, returns the node adjacent to the null endpoint.
static boolean	Edges.isBidirectedEdge(Edge edge)
static boolean	Edges.isDirectedEdge(Edge edge)
static boolean	SemGraph.isErrorEdge(Edge edge)
static boolean	Edges.isNondirectedEdge(Edge edge)
static boolean	Edges.isPartiallyOrientedEdge(Edge edge)
static boolean	Edges.isUndirectedEdge(Edge edge)
boolean	Dag.removeEdge(Edge edge)
boolean	EdgeListGraph.removeEdge(Edge edge)	Removes an edge from the graph.
boolean	Graph.removeEdge(Edge edge)	Removes the given edge from the graph.
boolean	LagGraph.removeEdge(Edge edge)
boolean	SemGraph.removeEdge(Edge edge)
boolean	TimeLagGraph.removeEdge(Edge edge)
static Node	Edges.traverse(Node node, Edge edge)
static Node	Edges.traverseDirected(Node node, Edge edge)	For A -> B, given A, returns B; otherwise returns null.
static Node	Edges.traverseReverseDirected(Node node, Edge edge)	For A -> B, given B, returns A; otherwise returns null.
static Node	Edges.traverseSemiDirected(Node node, Edge edge)	For A --* B or A o-* B, given A, returns B.
static Node	GraphUtils.traverseSemiDirected(Node node, Edge edge)

Method parameters in edu.cmu.tetrad.graph with type arguments of type Edge

Modifier and Type	Method	Description
static Set<Edge>	MisclassificationUtils.convertNodes(Set<Edge> edges, List<Node> newVariables)
boolean	Dag.removeEdges(Collection<Edge> edges)
boolean	EdgeListGraph.removeEdges(Collection<Edge> edges)	Removes any relevant edge objects found in this collection.
boolean	Graph.removeEdges(Collection<Edge> edges)	Iterates through the list and removes any permissible edges found.
boolean	LagGraph.removeEdges(Collection<Edge> edges)
boolean	SemGraph.removeEdges(Collection<Edge> edges)
boolean	TimeLagGraph.removeEdges(Collection<Edge> edges)
static void	Edges.sortEdges(List<Edge> edges)

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

Modifier	Constructor	Description
	Edge(Edge edge)

Constructor parameters in edu.cmu.tetrad.graph with type arguments of type Edge

Modifier	Constructor	Description
	GraphComparison(int adjFn, int adjFp, int adjCorrect, int arrowptFn, int arrowptFp, int arrowptCorrect, double adjPrec, double adjRec, double arrowptPrec, double arrowptRec, int shd, List<Edge> edgesAdded, List<Edge> edgesRemoved, int[][] counts)

Uses of Edge in edu.cmu.tetrad.search

Methods in edu.cmu.tetrad.search that return types with arguments of type Edge

Modifier and Type	Method	Description
static List<Edge>	CheckKnowledge.forbiddenViolations(Graph graph, Knowledge knowledge)	Returns a sorted list of edges that violate the given knowledge.
Set<Edge>	Cpc.getAdjacencies()	Returns the edges in the search graph as a set of undirected edges.
Set<Edge>	Pc.getAdjacencies()	Returns The edges of the searched graph.
Set<Edge>	Pcd.getAdjacencies()
Set<Edge>	Pc.getNonadjacencies()	Returns the non-adjacencies of the searched graph.
static List<Edge>	CheckKnowledge.requiredViolations(Graph graph, Knowledge knowledge)	Returns a sorted list of edges that are required by knowledge but which do not appear in the graph.

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

Methods in edu.cmu.tetrad.search.utils that return types with arguments of type Edge

Modifier and Type	Method	Description
Set<Edge>	PcCommon.getAdjacencies()	Returns The edges in the search graph.
Map<Edge,Edge>	MeekRules.getChangedEdges()	Returns a complete set of all the edges that were changed in the course of orientation, as a map from the previous edges in the graph to the new, changed edges for the same node pair.
Map<Edge,Edge>	MeekRules.getChangedEdges()	Returns a complete set of all the edges that were changed in the course of orientation, as a map from the previous edges in the graph to the new, changed edges for the same node pair.

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

Modifier and Type	Method	Description
static String	LogUtilsSearch.edgeOrientedMsg(String reason, Edge edge)

Uses of Edge in edu.cmu.tetrad.search.work_in_progress

Methods in edu.cmu.tetrad.search.work_in_progress that return Edge

Modifier and Type	Method	Description
Edge	HbsmsBeam.Move.getFirstEdge()
Edge	HbsmsBeam.Move.getSecondEdge()

Methods in edu.cmu.tetrad.search.work_in_progress that return types with arguments of type Edge

Modifier and Type	Method	Description
Set<Edge>	SampleVcpc.getAdjacencies()
Set<Edge>	SampleVcpcFast.getAdjacencies()
Set<Edge>	VcPc.getAdjacencies()
Set<Edge>	VcPcFast.getAdjacencies()
Map<Edge,Set<Node>>	VcFas.getApparentlyNonadjacencies()
Set<Edge>	SampleVcpc.getApparentNonadjacencies()
Set<Edge>	SampleVcpcFast.getApparentNonadjacencies()
Set<Edge>	VcPc.getApparentNonadjacencies()
Set<Edge>	VcPcFast.getApparentNonadjacencies()
Set<Edge>	SampleVcpc.getDefiniteNonadjacencies()
Set<Edge>	SampleVcpcFast.getDefiniteNonadjacencies()
Set<Edge>	VcPc.getDefiniteNonadjacencies()
Set<Edge>	VcPcFast.getDefiniteNonadjacencies()
List<Edge>	GraphChange.getRemoves()	Return removes

Methods in edu.cmu.tetrad.search.work_in_progress with parameters of type Edge

Modifier and Type	Method	Description
void	GraphChange.addRemove(Edge removalEdge)	Add another remove operation to the GraphChange.

Constructors in edu.cmu.tetrad.search.work_in_progress with parameters of type Edge

Modifier	Constructor	Description
	Move(Edge edge, Edge secondEdge, HbsmsBeam.Move.Type type)
	Move(Edge edge, HbsmsBeam.Move.Type type)

Uses of Edge in edu.cmu.tetrad.sem

Methods in edu.cmu.tetrad.sem that return Edge

Modifier and Type	Method	Description
Edge	StandardizedSemIm.ParameterRange.getEdge()

Methods in edu.cmu.tetrad.sem with parameters of type Edge

Modifier and Type	Method	Description
boolean	StandardizedSemIm.containsParameter(Edge edge)
double	SemIm.getEdgeCoef(Edge edge)
StandardizedSemIm.ParameterRange	StandardizedSemIm.getParameterRange(Edge edge)
double	StandardizedSemIm.getParameterValue(Edge edge)
void	StandardizedSemIm.setParameterValue(Edge edge, double value)

Constructors in edu.cmu.tetrad.sem with parameters of type Edge

Modifier	Constructor	Description
	ParameterRange(Edge edge, double coef, double low, double high)

Uses of Edge in edu.cmu.tetrad.simulation

Methods in edu.cmu.tetrad.simulation that return types with arguments of type Edge

Modifier and Type	Method	Description
List<Edge>	Vicinity.getVicinity(Edge edge, int chunk)

Methods in edu.cmu.tetrad.simulation with parameters of type Edge

Modifier and Type	Method	Description
List<Edge>	Vicinity.getVicinity(Edge edge, int chunk)

Constructor parameters in edu.cmu.tetrad.simulation with type arguments of type Edge

Modifier	Constructor	Description
	Vicinity(List<Edge> edges, DataSet locationMap, int xLow, int xHigh, int yLow, int yHigh, int zLow, int zHigh, double xDist, double yDist, double zDist)

Uses of Edge in edu.cmu.tetrad.util

Methods in edu.cmu.tetrad.util that return Edge

Modifier and Type	Method	Description
static Edge	JsonUtils.parseJSONObjectToTetradEdge(Graph graph, org.json.JSONObject jObj)

Methods in edu.cmu.tetrad.util that return types with arguments of type Edge

Modifier and Type	Method	Description
static Set<Edge>	JsonUtils.parseJSONArrayToTetradEdges(Graph graph, org.json.JSONArray jArray)