Uses of Class edu.cmu.tetrad.graph.Edge (tetrad-lib 7.6.7-SNAPSHOT API)

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)

Returns true if there is a common ancestor of X and Y in the graph.

static boolean

NumCommonMeasuredAncestorBidirected.existsCommonAncestor(Graph trueGraph, Edge edge)

existsCommonAncestor.

static boolean

LatentCommonAncestorTruePositiveBidirected.existsLatentCommonAncestor(Graph trueGraph, Edge edge)

existsLatentCommonAncestor.
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)

Returns the directed edge between the given nodes, if one exists in the graph.

Edge

EdgeListGraph.getDirectedEdge(Node node1, Node node2)

getDirectedEdge.

Edge

Graph.getDirectedEdge(Node node1, Node node2)

getDirectedEdge.

Edge

LagGraph.getDirectedEdge(Node node1, Node node2)

getDirectedEdge.

Edge

SemGraph.getDirectedEdge(Node node1, Node node2)

getDirectedEdge.

Edge

TimeLagGraph.getDirectedEdge(Node node1, Node node2)

Retrieves the directed edge connecting two nodes in the graph.

Edge

Dag.getEdge(Node node1, Node node2)

Retrieves the edge between two nodes in the graph.

Edge

EdgeListGraph.getEdge(Node node1, Node node2)

getEdge.

Edge

Graph.getEdge(Node node1, Node node2)

getEdge.

Edge

LagGraph.getEdge(Node node1, Node node2)

getEdge.

Edge

SemGraph.getEdge(Node node1, Node node2)

getEdge.

Edge

TimeLagGraph.getEdge(Node node1, Node node2)

Retrieves the edge between the given nodes.

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()

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)

convertNodes.

Set<Edge>

Dag.getEdges()

getEdges.

Set<Edge>

Dag.getEdges(Node node)

Returns a list of edges connected to the given node.

List<Edge>

Dag.getEdges(Node node1, Node node2)

Returns a list of edges between the specified nodes in the graph.

Set<Edge>

EdgeListGraph.getEdges()

getEdges.

Set<Edge>

EdgeListGraph.getEdges(Node node)

getEdges.

List<Edge>

EdgeListGraph.getEdges(Node node1, Node node2)

getEdges.

Set<Edge>

Graph.getEdges()

getEdges.

Set<Edge>

Graph.getEdges(Node node)

getEdges.

List<Edge>

Graph.getEdges(Node node1, Node node2)

getEdges.

Set<Edge>

LagGraph.getEdges()

getEdges.

Set<Edge>

LagGraph.getEdges(Node node)

getEdges.

List<Edge>

LagGraph.getEdges(Node node1, Node node2)

getEdges.

Set<Edge>

SemGraph.getEdges()

getEdges.

Set<Edge>

SemGraph.getEdges(Node node)

getEdges.

List<Edge>

SemGraph.getEdges(Node node1, Node node2)

getEdges.

Set<Edge>

TimeLagGraph.getEdges()

Retrieves the set of edges in the graph.

Set<Edge>

TimeLagGraph.getEdges(Node node)

Returns the list of edges connected to the specified node.

List<Edge>

TimeLagGraph.getEdges(Node node1, Node node2)

Finds all edges between two nodes.

List<Edge>

GraphUtils.GraphComparison.getEdgesAdded()

Returns the edges added.

List<Edge>

GraphUtils.GraphComparison.getEdgesRemoved()

Returns the edges removed.

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

Modifier and Type

Method

Description

boolean

Dag.addEdge(Edge edge)

Adds a directed edge to the Directed Acyclic Graph (DAG).

boolean

EdgeListGraph.addEdge(Edge edge)

Adds the specified edge to the graph, provided it is not already in 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)

Adds the specified edge to the graph, provided it is not already in the graph.

boolean

SemGraph.addEdge(Edge edge)

Adds the specified edge to the graph, provided it is not already in the graph.

boolean

TimeLagGraph.addEdge(Edge edge)

Adds a directed edge to the graph.

int

Edge.compareTo(Edge _edge)

compareTo.

static boolean

GraphUtils.compatible(Edge edge1, Edge edge2)

Determines if two edges are compatible.

boolean

Dag.containsEdge(Edge edge)

Checks if the given edge is present in the graph.

boolean

EdgeListGraph.containsEdge(Edge edge)

Determines whether this graph contains the given edge.

boolean

Graph.containsEdge(Edge edge)

Determines whether this graph contains the given edge.

boolean

LagGraph.containsEdge(Edge edge)

Determines whether this graph contains the given edge.

boolean

SemGraph.containsEdge(Edge edge)

Determines whether this graph contains the given edge.

boolean

TimeLagGraph.containsEdge(Edge edge)

Checks if the given Edge object exists in the graph.

boolean

Paths.defVisible(Edge edge)

Returns true just in case the given edge is definitely visible.

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)

isBidirectedEdge.

static boolean

GraphUtils.isCorrectBidirectedEdge(Edge edge, Graph trueGraph)

Determines if the given bidirected edge has a latent confounder in the true graph--that is, whether for X <-> Y there is a latent node Z such that X <- (Z) -> Y.

static boolean

Edges.isDirectedEdge(Edge edge)

isDirectedEdge.

static boolean

SemGraph.isErrorEdge(Edge edge)

isErrorEdge.

static boolean

Edges.isNondirectedEdge(Edge edge)

isNondirectedEdge.

static boolean

Edges.isPartiallyOrientedEdge(Edge edge)

isPartiallyOrientedEdge.

static boolean

Edges.isUndirectedEdge(Edge edge)

isUndirectedEdge.

boolean

Dag.removeEdge(Edge edge)

Removes a given edge from the graph.

boolean

EdgeListGraph.removeEdge(Edge edge)

Removes the given edge from the graph.

boolean

Graph.removeEdge(Edge edge)

Removes the given edge from the graph.

boolean

LagGraph.removeEdge(Edge edge)

Removes the given edge from the graph.

boolean

SemGraph.removeEdge(Edge edge)

Removes the given edge from the graph.

boolean

TimeLagGraph.removeEdge(Edge edge)

Removes an edge from the graph.

static Node

Edges.traverse(Node node, Edge edge)

If node is one endpoint of edge, returns the other endpoint.

static Node

Edges.traverseDirected(Node node, Edge edge)

For A -> B, given A, returns B; otherwise returns null.

static Node

Edges.traverseNondirected(Node node, Edge edge)

For A o-o 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)

Traverses a semi-directed edge to identify the next node in the traversal.

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)

convertNodes.

boolean

Dag.removeEdges(Collection<Edge> edges)

Removes the given edges from the graph.

boolean

EdgeListGraph.removeEdges(Collection<Edge> edges)

Iterates through the list and removes any permissible edges found.

boolean

Graph.removeEdges(Collection<Edge> edges)

Iterates through the list and removes any permissible edges found.

boolean

LagGraph.removeEdges(Collection<Edge> edges)

Iterates through the list and removes any permissible edges found.

boolean

SemGraph.removeEdges(Collection<Edge> edges)

Iterates through the list and removes any permissible edges found.

boolean

TimeLagGraph.removeEdges(Collection<Edge> edges)

Removes the specified collection of edges from the graph.

static void

Edges.sortEdges(List<Edge> edges)

sortEdges.

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

Modifier

Constructor

Description

Edge(Edge edge)

Constructor for 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 ahdFn, int ahdFp, int ahdCorrect, double adjPrec, double adjRec, double ahdPrec, double ahdRec, int shd, List<Edge> edgesAdded, List<Edge> edgesRemoved, int[][] counts)

Constructs a new GraphComparison.
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()

Returns the set of adjacent edges in the graph.

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.

static @NotNull Map<Node,Set<Edge>>

AlmostCycleRemover.getBMap(Graph pag)

Returns a map of nodes to bidirected edges for them.

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)

edgeOrientedMsg.
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()

Getter for the field edge.

Edge

HbsmsBeam.Move.getSecondEdge()

Getter for the field secondEdge.

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()

getAdjacencies.

Set<Edge>

SampleVcpcFast.getAdjacencies()

getAdjacencies.

Set<Edge>

VcPc.getAdjacencies()

getAdjacencies.

Set<Edge>

VcPcFast.getAdjacencies()

getAdjacencies.

Map<Edge,Set<Node>>

VcFas.getApparentlyNonadjacencies()

Getter for the field apparentlyNonadjacencies.

Set<Edge>

SampleVcpc.getApparentNonadjacencies()

getApparentNonadjacencies.

Set<Edge>

SampleVcpcFast.getApparentNonadjacencies()

getApparentNonadjacencies.

Set<Edge>

VcPc.getApparentNonadjacencies()

getApparentNonadjacencies.

Set<Edge>

VcPcFast.getApparentNonadjacencies()

getApparentNonadjacencies.

Set<Edge>

SampleVcpc.getDefiniteNonadjacencies()

getDefiniteNonadjacencies.

Set<Edge>

SampleVcpcFast.getDefiniteNonadjacencies()

getDefiniteNonadjacencies.

Set<Edge>

VcPc.getDefiniteNonadjacencies()

getDefiniteNonadjacencies.

Set<Edge>

VcPcFast.getDefiniteNonadjacencies()

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)

Constructor for Move.

Move(Edge edge, HbsmsBeam.Move.Type type)

Constructor for Move.
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()

Getter for the field edge.

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

Modifier and Type

Method

Description

boolean

StandardizedSemIm.containsParameter(Edge edge)

containsParameter.

double

SemIm.getEdgeCoef(Edge edge)

Getter for the field edgeCoef.

StandardizedSemIm.ParameterRange

StandardizedSemIm.getParameterRange(Edge edge)

getParameterRange.

double

StandardizedSemIm.getParameterValue(Edge edge)

getParameterValue.

void

StandardizedSemIm.setParameterValue(Edge edge, double value)

setParameterValue.

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

Modifier

Constructor

Description

ParameterRange(Edge edge, double coef, double low, double high)

Constructs a new parameter range.
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)

getVicinity.

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

Modifier and Type

Method

Description

List<Edge>

Vicinity.getVicinity(Edge edge, int chunk)

getVicinity.

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)

Constructor for Vicinity.
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)

parseJSONObjectToTetradEdge.

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)

parseJSONArrayToTetradEdges.

Uses of Classedu.cmu.tetrad.graph.Edge

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

Uses of Edge in edu.cmu.tetrad.graph

Uses of Edge in edu.cmu.tetrad.search

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

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

Uses of Edge in edu.cmu.tetrad.sem

Uses of Edge in edu.cmu.tetrad.simulation

Uses of Edge in edu.cmu.tetrad.util

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