@Test public void starTest() { UTGraph<String, Double> graph = new MapUTGraph<String, Double>(); UTNode<String, Double> a = graph.add("a"), b = graph.add("b"), c = graph.add("c"), d = graph.add("d"), e = graph.add("e"); b.connect(a, 0.5); c.connect(a, 0.5); d.connect(a, 0.5); e.connect(a, 0.5); System.out.println(graph); a.disconnect(b); System.out.println(graph); a.remove(); System.out.println(graph); }
@Override public UTNode<L, T> add(L label) { UTNode<L, T> node = new MapUTNode(label); modCount++; return node; }
MapUTGraph implements UTGraph<L, T>, HasPersistentNodes, HasPersistentLinks { @Override public UTNode<L, T> add(L label) { UTNode<L, T> node = new MapUTNode(label); modCount++; return node; } }
MapUTGraph implements UTGraph<L, T>, HasPersistentNodes, HasPersistentLinks { @Override public UTNode<L, T> add(L label) { UTNode<L, T> node = new MapUTNode(label); modCount++; return node; } MapUTGraph(); }
MapUTGraph implements UTGraph<L, T>, HasPersistentNodes, HasPersistentLinks { @Override public UTNode<L, T> add(L label) { UTNode<L, T> node = new MapUTNode(label); modCount++; return node; } MapUTGraph(); static MapUTGraph<L, T> copy(UTGraph<L, T> graph); static MapUTGraph<L,T> copy(UGraph<L> graph); @Override UTNode<L, T> node(L label); int size(); @Override Set<? extends UTNode<L, T>> nodes(L label); @Override UTNode<L, T> add(L label); boolean uniqueLabels(); String toString(); @Override boolean connected(L first, L second); @Override Set<L> labels(); @Override long numLinks(); @Override long state(); @Override List<? extends UTNode<L, T>> nodes(); @Override Iterable<MapUTLink> links(); @Override Set<T> tags(); @Override int hashCode(); @Override boolean equals(Object other); @Override UTNode<L, T> get(int i); @Override Class<? extends UTGraph<L, T>> level(); }
MapUTGraph implements UTGraph<L, T>, HasPersistentNodes, HasPersistentLinks { @Override public UTNode<L, T> add(L label) { UTNode<L, T> node = new MapUTNode(label); modCount++; return node; } MapUTGraph(); static MapUTGraph<L, T> copy(UTGraph<L, T> graph); static MapUTGraph<L,T> copy(UGraph<L> graph); @Override UTNode<L, T> node(L label); int size(); @Override Set<? extends UTNode<L, T>> nodes(L label); @Override UTNode<L, T> add(L label); boolean uniqueLabels(); String toString(); @Override boolean connected(L first, L second); @Override Set<L> labels(); @Override long numLinks(); @Override long state(); @Override List<? extends UTNode<L, T>> nodes(); @Override Iterable<MapUTLink> links(); @Override Set<T> tags(); @Override int hashCode(); @Override boolean equals(Object other); @Override UTNode<L, T> get(int i); @Override Class<? extends UTGraph<L, T>> level();  }