ConsistencyParameterization implements Parameterization { public static Tree<Treatment, FoldedEdge<Treatment, Study>> findSpanningTree(UndirectedGraph<Treatment, FoldedEdge<Treatment, Study>> cGraph) { MinimumDiameterSpanningTree<Treatment, FoldedEdge<Treatment, Study>> mdst = new MinimumDiameterSpanningTree<Treatment, FoldedEdge<Treatment, Study>>(cGraph, TreatmentComparator.INSTANCE); return mdst.getMinimumDiameterSpanningTree(); } ConsistencyParameterization(Network network, Tree<Treatment, FoldedEdge<Treatment, Study>> tree, Map<Study, Treatment> baselines); static ConsistencyParameterization create(Network network); static Tree<Treatment, FoldedEdge<Treatment, Study>> findSpanningTree(UndirectedGraph<Treatment, FoldedEdge<Treatment, Study>> cGraph); static Map<Study, Treatment> findStudyBaselines(Hypergraph<Treatment, Study> studyGraph, Tree<Treatment, FoldedEdge<Treatment, Study>> tree); List<NetworkParameter> getParameters(); static List<NetworkParameter> getBasicParameters(Tree<Treatment, FoldedEdge<Treatment, Study>> tree); Map<NetworkParameter, Integer> parameterize(Treatment ta, Treatment tb); Treatment getStudyBaseline(Study s); List<List<Pair<Treatment>>> parameterizeStudy(Study s); Graph<Treatment, FoldedEdge<Treatment, Study>> getBasicParameterTree();  }
@Test public void testFindSpanningTree() { UndirectedGraph<Treatment, FoldedEdge<Treatment, Study>> cGraph = NetworkModel.createComparisonGraph(d_network); Tree<Treatment, FoldedEdge<Treatment, Study>> tree = ConsistencyParameterization.findSpanningTree(cGraph); assertEquals(d_ta, tree.getRoot()); assertNotNull(tree.findEdge(d_ta, d_tb)); assertNotNull(tree.findEdge(d_ta, d_tc)); assertNotNull(tree.findEdge(d_ta, d_td)); }