Package edu.cmu.tetrad.graph

package edu.cmu.tetrad.graph

Class	Description
ConsistentDagIterator	Lazily enumerates the consistent DAG extensions of a DAG or CPDAG.
Dag	Represents a directed acyclic graph--that is, a graph containing only directed edges, with no cycles.
Edge	Represents an edge node1 *-# node2 where * and # are endpoints of type Endpoint--that is, Endpoint.TAIL, Endpoint.ARROW, or Endpoint.CIRCLE.
Edge.Property	A property of an edge.
EdgeListGraph	Stores a graph a list of lists of edges adjacent to each node in the graph, with an additional list storing all of the edges in the graph.
EdgeReplicationPolicy	Strategy interface: given a seed edge E on graph G, return the full set of mirrored edges that should be kept in sync with E.
Edges	This factory class produces edges of the types commonly used for Tetrad-style graphs.
EdgeShading	A small color-vision-safe palette for shading graph edges by the sign and strength of an estimated effect.
EdgeShading.Hue	The hue families.
EdgeTypeProbability	Apr 13, 2017 3:56:46 PM
EdgeTypeProbability.EdgeType	An enumeration of the different types of edges.
Endpoint	A enumeration of the endpoint types that are permitted in Tetrad-style graphs: null (-), arrow (->), circle (-o), start (-*), and null (no endpoint).
Graph	Implements a graph capable of storing edges of type N1 *-# N2 where * and # are endpoints of type Endpoint.
GraphFactoryUtil	Utility class providing factory methods for creating instances of different types of Graph objects.
GraphNode	Implements a basic node in a graph--that is, a node that is not itself a variable.
GraphSaveLoadUtils	Methods to load or save graphs.
GraphTransforms	Transformations that transform one graph into another.
GraphUtils	Utility class for working with graphs.
GraphUtils.GraphComparison	Represents a comparison between two graphs.
GraphUtils.GraphType	The GraphType enum represents the types of graphs that can be used in the application.
GraphUtils.TwoCycleErrors	Two-cycle errors.
IndependenceFact	Stores a triple (x, y, z) of nodes.
LagGraph	Implements a graph allowing nodes in the getModel time lag to have parents taken from previous time lags.
LagReplicationPolicy	SVAR-style lag mirroring policy.
LayoutUtil	LayoutUtil class.
LayoutUtil.DefaultLayout	The layouts that can serve as the default layout: the ones that need nothing but the graph.
LayoutUtil.FruchtermanReingoldLayout	Lays out a graph by linearly summing repulsive force between all nodes and attractive force between adjacent nodes.
LayoutUtil.KamadaKawaiLayout	Lays out a graph by placing springs between the nodes and letting the system settle (one node at a time).
LayoutUtil.LayoutProgressListener	Callback interface for reporting layout progress.
LayoutUtil.NodeSize	Supplies the rendered box size of each node, so a layout can space nodes by what they actually take up on screen.
LayoutUtil.NoOpProgressListener	No-op listener for headless / non-GUI use.
LayoutUtil.SwingProgressListener	Swing adapter that wraps a ProgressMonitor.
LegEnumerator	Lazily enumerates the Loyal Equivalent Graphs (LEGs) of a directed Markov equivalence class by walking the class transformationally, via Zhang & Spirtes' legitimate directed-edge reversals rather than by re-orienting the circle component from scratch.
MisclassificationUtils	Some utilities for generating misclassification tables for graphs.
Node	Represents an object with a name, node type, and position that can serve as a node in a graph.
NodePair	An unordered pair of nodes.
NodeType	An enum of the node types in a graph (MEASURED, LATENT, ERROR).
NodeVariableType	Node variable type.
OrderedPair<E>	An ordered pair of objects.
Paths	Paths class.
Paths.AllCliquesAlgorithm	An algorithm to find all cliques in a graph.
Paths.CpdagCheckResult	Represents the result of a CPDAG legality check.
Paths.CpdagViolation	Enumeration representing various violations associated with CPDAGs (Completed Partially Directed Acyclic Graphs).
RandomGraph	The RandomGraph class provides methods for generating random graphs.
RandomGraph.UniformGraphGenerator	Generates random DAGs uniformly with certain classes of DAGs using variants of Markov chain algorithm by Malancon, Dutour, and Philippe.
RandomMim	Flexible MIM (Multiple Indicator Model) generator.
RandomMim.LatentGroupSpec	Specification for a block of groups sharing the same rank and number of children per latent.
RandomMim.LatentLinkMode	Enum representing the mode of linking between latent nodes across groups in the meta-DAG.
RandomMimic	Flexible MIMIC (Multiple Indicators Multiple Causes) graph generator.
RandomMimic.MimicGroupSpec	Specification for a block of MIMIC groups sharing the same structure.
ReplicatingGraph	EdgeListGraph subclass that applies an EdgeReplicationPolicy whenever edges are added/removed or endpoints are oriented.
ReplicatingGraphTest	Tests for ReplicatingGraph with LagReplicationPolicy.
SemGraph	Represents the graphical structure of a structural equation model.
TimeLagGraph	Represents a time series graph--that is, a graph with a fixed number S of lags, with edges into initial lags only--that is, into nodes in the first R lags, for some R.
TimeLagGraph.NodeId	Represents a NodeId with a name and a lag value.
Triple	Stores a triple (x, y, z) of nodes.
TripleClassifier	Marks a search algorithm as a triad classifier and returns the triad classifications if makes.
Underlines	Underlines class.
ValidOrderIterator	Lazily enumerates EVERY valid causal order of a DAG or CPDAG, each exactly once.