Package edu.cmu.tetrad.graph
package edu.cmu.tetrad.graph
-
ClassDescriptionRepresents a directed acyclic graph--that is, a graph containing only directed edges, with no cycles.Represents an edge node1 *-# node2 where * and # are endpoints of type Endpoint--that is, Endpoint.TAIL, Endpoint.ARROW, or Endpoint.CIRCLE.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.This factory class produces edges of the types commonly used for Tetrad-style graphs.Apr 13, 2017 3:56:46 PMA typesafe enumeration of the types of endpoints that are permitted in Tetrad-style graphs: null (-), arrow (->), circle (-o), start (-*), and null (no endpoint).Implements a graph capable of storing edges of type N1 *-# N2 where * and # are endpoints of type Endpoint.Implements a basic node in a graph--that is, a node that is not itself a variable.Methods to load or save graphs.Transformations that transform one graph into another.Basic graph utilities.Stores a triple (x, y, z) of nodes.Implements a graph allowing nodes in the getModel time lag to have parents taken from previous time lags.Lays out a graph by linearly summing repulsive force between all nodes and attractive force between adjacent nodes.Lays out a graph by placing springs between the nodes and letting the system settle (one node at a time).Some utilities for generating misclassification tables for graphs.Represents an object with a name, node type, and position that can serve as a node in a graph.An unordered pair of nodes.A typesafe enum of the types of the types of nodes in a graph (MEASURED, LATENT, ERROR).Node variable type.OrderedPair<E>An ordered pair of objects.Generates random DAGs uniformly with certain classes of DAGs using variants of Markov chain algorithm by Malancon, Dutour, and Philippe.Represents the graphical structure of a structural equation model.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.Stores a triple (x, y, z) of nodes.Marks a search algorithm as a triad classifier and returns the triad classifications if makes.