Package edu.cmu.tetrad.util
Class GraphSampling
java.lang.Object
edu.cmu.tetrad.util.GraphSampling
A utility for computing frequency probabilities.
Jan 29, 2023 3:28:26 PM
- Author:
- Kevin V. Bui (kvb2univpitt@gmail.com)
-
Method Summary
Modifier and TypeMethodDescriptionstatic GraphcreateDisplayGraph(Graph graph, ResamplingEdgeEnsemble ensemble) Create a graph for displaying and print out.static GraphcreateGraphWithHighProbabilityEdges(List<Graph> graphs) Combine all the edges from the list of graphs onto one graph with the edge type that has the highest frequency probability.static GraphcreateGraphWithHighProbabilityEdges(List<Graph> graphs, ResamplingEdgeEnsemble ensemble) static GraphcreateGraphWithoutNullEdges(Graph graph) Create a graph from the given graph that contains no null edges.static Set<edu.cmu.tetrad.util.GraphSampling.NodePair>getEdgeNodePairs(List<Graph> graphs)
-
Method Details
-
createGraphWithoutNullEdges
Create a graph from the given graph that contains no null edges.- Parameters:
graph- the given graph- Returns:
- graph that contains no null edges
-
createDisplayGraph
Create a graph for displaying and print out.- Parameters:
graph-ensemble-- Returns:
-
createGraphWithHighProbabilityEdges
public static Graph createGraphWithHighProbabilityEdges(List<Graph> graphs, ResamplingEdgeEnsemble ensemble) -
createGraphWithHighProbabilityEdges
Combine all the edges from the list of graphs onto one graph with the edge type that has the highest frequency probability.- Parameters:
graphs- list of graphs- Returns:
- graph containing edges with edge type of the highest probability
-
getEdgeNodePairs
-