@Test public void testConnected() { UTGraph<String, Double> graph = new MapUTGraph<String, Double>(); UTNode<String, Double> a = graph.add("a"), b = graph.add("b"), c = graph.add("c"); a.connect(b, 0.5); assertTrue(a.connected(b)); assertFalse(a.connected(a)); assertTrue(b.connected(a)); assertFalse(a.connected(c)); assertFalse(c.connected(a)); assertFalse(b.connected(c)); assertFalse(c.connected(b)); }
@Override public boolean connected(L first, L second) { for(MapUTNode f : nodes.get(first)) for(MapUTNode s : nodes.get(second)) if(f.connected(s)) return true; return false; }
MapUTGraph implements UTGraph<L, T>, HasPersistentNodes, HasPersistentLinks { @Override public boolean connected(L first, L second) { for(MapUTNode f : nodes.get(first)) for(MapUTNode s : nodes.get(second)) if(f.connected(s)) return true; return false; } }
MapUTGraph implements UTGraph<L, T>, HasPersistentNodes, HasPersistentLinks { @Override public boolean connected(L first, L second) { for(MapUTNode f : nodes.get(first)) for(MapUTNode s : nodes.get(second)) if(f.connected(s)) return true; return false; } MapUTGraph(); }
MapUTGraph implements UTGraph<L, T>, HasPersistentNodes, HasPersistentLinks { @Override public boolean connected(L first, L second) { for(MapUTNode f : nodes.get(first)) for(MapUTNode s : nodes.get(second)) if(f.connected(s)) return true; return false; } 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 boolean connected(L first, L second) { for(MapUTNode f : nodes.get(first)) for(MapUTNode s : nodes.get(second)) if(f.connected(s)) return true; return false; } 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();  }