public static <V,E> HashBasedHipsterGraph<V, E> create() { return new HashBasedHipsterGraph<V, E>(); } }
public class Pair implements Comparable<Pair> { private Integer e1; private Integer e2; @Override public int compareTo(Pair o) { return getE1().compareTo(o.getE1()); } }
@Override public GraphEdge<V, E> buildEdge(V v1, V v2, E value) { return new DirectedEdge<V, E>(v1, v2, value); }
public UndirectedEdge(V vertex1, V vertex2, E value) { this.vertices = new UnorderedPair<V>(vertex1, vertex2); this.value = value; }
public static <V, E> GraphBuilder<V,E> create() { return new GraphBuilder<V, E>(); }
public static <V, E> HashBasedHipsterDirectedGraph<V, E> create() { return new HashBasedHipsterDirectedGraph<V, E>(); } }
@Override public V getVertex2() { return vertices.getE2(); }
@Override public V getVertex1() { return vertices.getE1(); }
public DirectedEdge(V vertex1, V vertex2, E value) { this.vertices = new Pair<V>(vertex1, vertex2); this.value = value; }
@Override public V getVertex2() { return vertices.getE2(); }
@Override public V getVertex1() { return vertices.getE1(); }
public static <V,E> HashBasedHipsterGraph<V, E> create() { return new HashBasedHipsterGraph<V, E>(); } }
public UndirectedEdge(V vertex1, V vertex2, E value) { this.vertices = new UnorderedPair<V>(vertex1, vertex2); this.value = value; }
public static <V, E> GraphBuilder<V,E> create() { return new GraphBuilder<V, E>(); }