Uses of Class
edu.cmu.tetrad.graph.Edge
Packages that use Edge
Package
Description
This package contains classes for causal graph search algorithms.
This package contains utility classes for causal graph search algorithms.
A package for algorithms that are not ready for prime time.
-
Uses of Edge in edu.cmu.tetrad.algcomparison.statistic
Methods in edu.cmu.tetrad.algcomparison.statistic with parameters of type EdgeModifier and TypeMethodDescriptionstatic booleanCommonAncestorTruePositiveBidirected.existsCommonAncestor(Graph trueGraph, Edge edge) Returns true if there is a common ancestor of X and Y in the graph.static booleanNumCommonMeasuredAncestorBidirected.existsCommonAncestor(Graph trueGraph, Edge edge) existsCommonAncestor.static booleanLatentCommonAncestorTruePositiveBidirected.existsLatentCommonAncestor(Graph trueGraph, Edge edge) existsLatentCommonAncestor. -
Uses of Edge in edu.cmu.tetrad.graph
Methods in edu.cmu.tetrad.graph that return EdgeModifier and TypeMethodDescriptionstatic EdgeEdges.bidirectedEdge(Node nodeA, Node nodeB) Constructs a new bidirected edge from nodeA to nodeB (<->).static EdgeEdges.directedEdge(Node nodeA, Node nodeB) Constructs a new directed edge from nodeA to nodeB (-->).Dag.getDirectedEdge(Node node1, Node node2) Returns the directed edge between the given nodes, if one exists in the graph.EdgeListGraph.getDirectedEdge(Node node1, Node node2) getDirectedEdge.Graph.getDirectedEdge(Node node1, Node node2) getDirectedEdge.LagGraph.getDirectedEdge(Node node1, Node node2) getDirectedEdge.SemGraph.getDirectedEdge(Node node1, Node node2) getDirectedEdge.TimeLagGraph.getDirectedEdge(Node node1, Node node2) Retrieves the directed edge connecting two nodes in the graph.Retrieves the edge between two nodes in the graph.getEdge.getEdge.getEdge.getEdge.Retrieves the edge between the given nodes.static EdgeEdges.nondirectedEdge(Node nodeA, Node nodeB) Constructs a new nondirected edge from nodeA to nodeB (o-o).static EdgeEdges.partiallyOrientedEdge(Node nodeA, Node nodeB) Constructs a new partially oriented edge from nodeA to nodeB (o->).Edge.reverse()Reverses the edge, so that it if was X->Y it's now Y->X, or vice-versa.Edge.sameEdgeFlippedDirection()Flips this edge, so that if it's X->Y it's now Y<-X, or vice-versa.static EdgeEdge.serializableInstance()Generates a simple exemplar of this class to test serialization.static EdgeEdges.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 EdgeModifier and TypeMethodDescriptionMisclassificationUtils.convertNodes(Set<Edge> edges, List<Node> newVariables) convertNodes.Dag.getEdges()getEdges.Returns a list of edges connected to the given node.Returns a list of edges between the specified nodes in the graph.EdgeListGraph.getEdges()getEdges.getEdges.getEdges.Graph.getEdges()getEdges.getEdges.getEdges.LagGraph.getEdges()getEdges.getEdges.getEdges.SemGraph.getEdges()getEdges.getEdges.getEdges.TimeLagGraph.getEdges()Retrieves the set of edges in the graph.Returns the list of edges connected to the specified node.Finds all edges between two nodes.GraphUtils.GraphComparison.getEdgesAdded()Returns the edges added.GraphUtils.GraphComparison.getEdgesRemoved()Returns the edges removed.EdgeReplicationPolicy.mirrorsFor(EdgeListGraph g, Edge e) Returns a set of mirrored edges in the given graph that should be kept in sync with the specified edge.LagReplicationPolicy.mirrorsFor(EdgeListGraph g, Edge e) Generates a set of mirrored edges for a given edge in the graph, based on the lagging conventions of the node names.Methods in edu.cmu.tetrad.graph with parameters of type EdgeModifier and TypeMethodDescriptionbooleanAdds a directed edge to the Directed Acyclic Graph (DAG).booleanAdds the specified edge to the graph, provided it is not already in the graph.booleanAdds the specified edge to the graph, provided it is not already in the graph.booleanAdds the specified edge to the graph, provided it is not already in the graph.booleanAdds an edge to the graph and performs additional processing to mirror edges based on the defined edge replication policy.booleanAdds the specified edge to the graph, provided it is not already in the graph.booleanAdds a directed edge to the graph.intcompareTo.static booleanGraphUtils.compatible(Edge edge1, Edge edge2) Determines if two edges are compatible.booleanDag.containsEdge(Edge edge) Checks if the given edge is present in the graph.booleanEdgeListGraph.containsEdge(Edge edge) Determines whether this graph contains the given edge.booleanGraph.containsEdge(Edge edge) Determines whether this graph contains the given edge.booleanLagGraph.containsEdge(Edge edge) Determines whether this graph contains the given edge.booleanSemGraph.containsEdge(Edge edge) Determines whether this graph contains the given edge.booleanTimeLagGraph.containsEdge(Edge edge) Checks if the givenEdgeobject exists in the graph.static NodeEdges.getDirectedEdgeHead(Edge edge) For a directed edge, returns the node adjacent to the arrow endpoint.static NodeEdges.getDirectedEdgeTail(Edge edge) For a directed edge, returns the node adjacent to the null endpoint.static booleanEdges.isBidirectedEdge(Edge edge) isBidirectedEdge.static booleanGraphUtils.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 booleanEdges.isDirectedEdge(Edge edge) isDirectedEdge.static booleanSemGraph.isErrorEdge(Edge edge) isErrorEdge.static booleanEdges.isNondirectedEdge(Edge edge) isNondirectedEdge.static booleanEdges.isPartiallyOrientedEdge(Edge edge) isPartiallyOrientedEdge.static booleanEdges.isUndirectedEdge(Edge edge) isUndirectedEdge.EdgeReplicationPolicy.mirrorsFor(EdgeListGraph g, Edge e) Returns a set of mirrored edges in the given graph that should be kept in sync with the specified edge.LagReplicationPolicy.mirrorsFor(EdgeListGraph g, Edge e) Generates a set of mirrored edges for a given edge in the graph, based on the lagging conventions of the node names.booleanDag.removeEdge(Edge edge) Removes a given edge from the graph.booleanEdgeListGraph.removeEdge(Edge edge) Removes the given edge from the graph.booleanGraph.removeEdge(Edge edge) Removes the given edge from the graph.booleanLagGraph.removeEdge(Edge edge) Removes the given edge from the graph.booleanReplicatingGraph.removeEdge(Edge e) Removes an edge from the graph, and if applicable, removes its mirrored counterparts according to the edge replication policy.booleanSemGraph.removeEdge(Edge edge) Removes the given edge from the graph.booleanTimeLagGraph.removeEdge(Edge edge) Removes an edge from the graph.static NodeIf node is one endpoint of edge, returns the other endpoint.static NodeEdges.traverseDirected(Node node, Edge edge) For A -> B, given A, returns B; otherwise returns null.static NodeEdges.traverseNondirected(Node node, Edge edge) For A o-o B, given A, returns B; otherwise returns null.static NodeEdges.traverseReverseDirected(Node node, Edge edge) For A -> B, given B, returns A; otherwise returns null.static NodeEdges.traverseSemiDirected(Node node, Edge edge) For A --* B or A o-* B, given A, returns B.static NodeGraphUtils.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 EdgeModifier and TypeMethodDescriptionMisclassificationUtils.convertNodes(Set<Edge> edges, List<Node> newVariables) convertNodes.booleanDag.removeEdges(Collection<Edge> edges) Removes the given edges from the graph.booleanEdgeListGraph.removeEdges(Collection<Edge> edges) Iterates through the list and removes any permissible edges found.booleanGraph.removeEdges(Collection<Edge> edges) Iterates through the list and removes any permissible edges found.booleanLagGraph.removeEdges(Collection<Edge> edges) Iterates through the list and removes any permissible edges found.booleanSemGraph.removeEdges(Collection<Edge> edges) Iterates through the list and removes any permissible edges found.booleanTimeLagGraph.removeEdges(Collection<Edge> edges) Removes the specified collection of edges from the graph.static voidsortEdges.Constructors in edu.cmu.tetrad.graph with parameters of type EdgeConstructor parameters in edu.cmu.tetrad.graph with type arguments of type EdgeModifierConstructorDescriptionGraphComparison(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 EdgeModifier and TypeMethodDescriptionSingletonAttacher.attachSingletonChildren(org.ejml.simple.SimpleMatrix S, int sampleSize, double alpha, int minDrop, int p, List<List<Integer>> latentBlocks, List<Node> latentNodes, List<Integer> singletonCols, List<Node> singletonNodes) Returns latent->singleton edges to add.CheckKnowledge.forbiddenViolations(Graph graph, Knowledge knowledge) Returns a sorted list of edges that violate the given knowledge.Pcd.getAdjacencies()Returns the set of adjacent edges in the graph.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 EdgeModifier and TypeMethodDescriptionReturns a map of nodes to bidirected edges for them.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.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 EdgeModifier and TypeMethodDescriptionstatic StringLogUtilsSearch.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 EdgeModifier and TypeMethodDescriptionHbsmsBeam.Move.getFirstEdge()Getter for the fieldedge.HbsmsBeam.Move.getSecondEdge()Getter for the fieldsecondEdge.Methods in edu.cmu.tetrad.search.work_in_progress that return types with arguments of type EdgeModifier and TypeMethodDescriptionSampleVcpc.getAdjacencies()getAdjacencies.SampleVcpcFast.getAdjacencies()getAdjacencies.VcPc.getAdjacencies()getAdjacencies.VcPcFast.getAdjacencies()getAdjacencies.VcFas.getApparentlyNonadjacencies()Getter for the fieldapparentlyNonadjacencies.SampleVcpc.getApparentNonadjacencies()getApparentNonadjacencies.SampleVcpcFast.getApparentNonadjacencies()getApparentNonadjacencies.VcPc.getApparentNonadjacencies()getApparentNonadjacencies.VcPcFast.getApparentNonadjacencies()getApparentNonadjacencies.SampleVcpc.getDefiniteNonadjacencies()getDefiniteNonadjacencies.SampleVcpcFast.getDefiniteNonadjacencies()getDefiniteNonadjacencies.VcPc.getDefiniteNonadjacencies()getDefiniteNonadjacencies.VcPcFast.getDefiniteNonadjacencies()getDefiniteNonadjacencies.GraphChange.getRemoves()Return removesMethods in edu.cmu.tetrad.search.work_in_progress with parameters of type EdgeModifier and TypeMethodDescriptionvoidAdd another remove operation to the GraphChange.Constructors in edu.cmu.tetrad.search.work_in_progress with parameters of type EdgeModifierConstructorDescriptionMove(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 EdgeModifier and TypeMethodDescriptionStandardizedSemIm.ParameterRange.getEdge()Getter for the fieldedge.Methods in edu.cmu.tetrad.sem with parameters of type EdgeModifier and TypeMethodDescriptionbooleanStandardizedSemIm.containsParameter(Edge edge) containsParameter.doubleSemIm.getEdgeCoef(Edge edge) Getter for the fieldedgeCoef.StandardizedSemIm.getParameterRange(Edge edge) getParameterRange.doubleStandardizedSemIm.getParameterValue(Edge edge) getParameterValue.voidStandardizedSemIm.setParameterValue(Edge edge, double value) setParameterValue.Constructors in edu.cmu.tetrad.sem with parameters of type EdgeModifierConstructorDescriptionParameterRange(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 EdgeMethods in edu.cmu.tetrad.simulation with parameters of type EdgeConstructor parameters in edu.cmu.tetrad.simulation with type arguments of type Edge -
Uses of Edge in edu.cmu.tetrad.util
Methods in edu.cmu.tetrad.util that return EdgeModifier and TypeMethodDescriptionstatic EdgeJsonUtils.parseJSONObjectToTetradEdge(Graph graph, org.json.JSONObject jObj) parseJSONObjectToTetradEdge.Methods in edu.cmu.tetrad.util that return types with arguments of type EdgeModifier and TypeMethodDescriptionJsonUtils.parseJSONArrayToTetradEdges(Graph graph, org.json.JSONArray jArray) parseJSONArrayToTetradEdges.