@Test public void test() { DGraph<String> data = new MapDTGraph<String,String>(); Node<String> a = data.add("a"); Node<String> b = data.add("b"); Node<String> c = data.add("c"); a.connect(b); b.connect(c); c.connect(a); EdgeListCompressor<String> comp = new EdgeListCompressor<String>(); assertEquals( nl.peterbloem.kit.Functions.prefix(3) + nl.peterbloem.kit.Functions.prefix(3) - log2(1.0/9) + - log2(1.0/25) - log2(1.0/49) - 2.58496250072, comp.directed(data), 0.001); }
public static <N> double directed(DGraph<N> graph) { return directed(graph, true); }
EdgeListCompressor extends AbstractGraphCompressor<N> { public static <N> double directed(DGraph<N> graph) { return directed(graph, true); } }
EdgeListCompressor extends AbstractGraphCompressor<N> { public static <N> double directed(DGraph<N> graph) { return directed(graph, true); } EdgeListCompressor();  EdgeListCompressor(boolean storeLabels); }
EdgeListCompressor extends AbstractGraphCompressor<N> { public static <N> double directed(DGraph<N> graph) { return directed(graph, true); } EdgeListCompressor();  EdgeListCompressor(boolean storeLabels); @Override double structureBits(Graph<N> graph, List<Integer> order); static double undirected(Graph<N> graph); static double undirected(Graph<N> graph, boolean withPrior); static double directed(DGraph<N> graph); static double directed(DGraph<N> graph, boolean withPrior); }
EdgeListCompressor extends AbstractGraphCompressor<N> { public static <N> double directed(DGraph<N> graph) { return directed(graph, true); } EdgeListCompressor();  EdgeListCompressor(boolean storeLabels); @Override double structureBits(Graph<N> graph, List<Integer> order); static double undirected(Graph<N> graph); static double undirected(Graph<N> graph, boolean withPrior); static double directed(DGraph<N> graph); static double directed(DGraph<N> graph, boolean withPrior);  }