@Test public void testGetHubs() { DTGraph<String, String> graph = new MapDTGraph<String, String>(); DTNode<String, String> a = graph.add("a"), b = graph.add("b"); b.connect(a, "0"); graph.add("x").connect(a, "0"); graph.add("x").connect(a, "0"); graph.add("x").connect(a, "0"); graph.add("x").connect(b, "1"); graph.add("x").connect(b, "2"); graph.add("x").connect(b, "3"); graph.add("x").connect(b, "4"); graph.add("x").connect(b, "5"); graph.add("x").connect(b, "6"); graph.add("x").connect(b, "7"); graph.add("x").connect(b, "8"); graph.add("x").connect(b, "9"); graph.add("x").connect(b, "10"); graph.add("x").connect(b, "11"); graph.add("x").connect(b, "12"); assertEquals(a, SlashBurn.getHubs(graph, 1, 1, true).get(0)); assertEquals(b, SlashBurn.getHubs(graph, 1, 1, false).get(0)); }
public static <L, T> List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, boolean useSignatures) { return getHubs(graph, k, -1, useSignatures); }
SlashBurn { public static <L, T> List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, boolean useSignatures) { return getHubs(graph, k, -1, useSignatures); } }
SlashBurn { public static <L, T> List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, boolean useSignatures) { return getHubs(graph, k, -1, useSignatures); } SlashBurn(Graph<N> graph, int k);  SlashBurn(Graph<N> graph, int k, List<List<Integer>> islands);  SlashBurn(Graph<N> graph, int k, Comparator<Node<N>> centralityComparator);  SlashBurn(Graph<N> graph, int k, Comparator<Node<N>> centralityComparator, List<List<Integer>> islands); }
SlashBurn { public static <L, T> List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, boolean useSignatures) { return getHubs(graph, k, -1, useSignatures); } SlashBurn(Graph<N> graph, int k);  SlashBurn(Graph<N> graph, int k, List<List<Integer>> islands);  SlashBurn(Graph<N> graph, int k, Comparator<Node<N>> centralityComparator);  SlashBurn(Graph<N> graph, int k, Comparator<Node<N>> centralityComparator, List<List<Integer>> islands); BitString mask(); @Deprecated List<Integer> orderInts(); Order order(); int headSize(); int tailSize(); void iterate(); void finish(); boolean done(); int iterations(); double wingWidthRatio(); void check(); static List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, boolean useSignatures); static List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, int iterations,  boolean useSignatures); static Pair<Dir, T> primeSignature(DTNode<L, T> node); static int primeDegree(DTNode<L, T> node); }
SlashBurn { public static <L, T> List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, boolean useSignatures) { return getHubs(graph, k, -1, useSignatures); } SlashBurn(Graph<N> graph, int k);  SlashBurn(Graph<N> graph, int k, List<List<Integer>> islands);  SlashBurn(Graph<N> graph, int k, Comparator<Node<N>> centralityComparator);  SlashBurn(Graph<N> graph, int k, Comparator<Node<N>> centralityComparator, List<List<Integer>> islands); BitString mask(); @Deprecated List<Integer> orderInts(); Order order(); int headSize(); int tailSize(); void iterate(); void finish(); boolean done(); int iterations(); double wingWidthRatio(); void check(); static List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, boolean useSignatures); static List<DTNode<L, T>> getHubs(DTGraph<L, T> graph, int k, int iterations,  boolean useSignatures); static Pair<Dir, T> primeSignature(DTNode<L, T> node); static int primeDegree(DTNode<L, T> node);  }