@Test public void edge() { Graph g = new Graph(5); g.addAtom(mock(Atom.class)); g.addAtom(mock(Atom.class)); g.addAtom(mock(Atom.class)); g.addEdge(new Edge(0, 1, Bond.IMPLICIT)); g.addEdge(new Edge(1, 2, Bond.IMPLICIT)); assertThat(g.edge(0, 1), is(new Edge(0, 1, Bond.IMPLICIT))); assertThat(g.edge(1, 2), is(new Edge(1, 2, Bond.IMPLICIT))); }
public Edge edge(int u, int v) { final int d = degrees[u]; for (int j = 0; j < d; ++j) { Edge e = edges[u][j]; if (e.other(u) == v) return e; } throw new IllegalArgumentException(u + ", " + v + " are not adjacent"); }
Graph { public Edge edge(int u, int v) { final int d = degrees[u]; for (int j = 0; j < d; ++j) { Edge e = edges[u][j]; if (e.other(u) == v) return e; } throw new IllegalArgumentException(u + ", " + v + " are not adjacent"); } }
Graph { public Edge edge(int u, int v) { final int d = degrees[u]; for (int j = 0; j < d; ++j) { Edge e = edges[u][j]; if (e.other(u) == v) return e; } throw new IllegalArgumentException(u + ", " + v + " are not adjacent"); } Graph(int expSize);   Graph(Graph org); }
Graph { public Edge edge(int u, int v) { final int d = degrees[u]; for (int j = 0; j < d; ++j) { Edge e = edges[u][j]; if (e.other(u) == v) return e; } throw new IllegalArgumentException(u + ", " + v + " are not adjacent"); } Graph(int expSize);   Graph(Graph org); Atom atom(int i); int degree(int u); List<Edge> edges(int u); int[] neighbors(int u); boolean adjacent(int u, int v); int implHCount(int u); Edge edge(int u, int v); Edge edgeAt(int u, int j); Topology topologyOf(int u); Configuration configurationOf(int u); int order(); int size(); static Graph fromSmiles(String smi); static Graph parse(String smi, boolean strict, Set<String> warnings); String toSmiles(); String toSmiles(int[] visitedAt); Graph aromatic(); Graph resonate(); Graph kekule(); boolean assignable(); Graph permute(int[] p); Iterable<Atom> atoms(); Iterable<Edge> edges(); int getFlags(final int mask); int getFlags(); void setTitle(String title); String getTitle(); Graph sort(EdgeComparator comparator); }
Graph { public Edge edge(int u, int v) { final int d = degrees[u]; for (int j = 0; j < d; ++j) { Edge e = edges[u][j]; if (e.other(u) == v) return e; } throw new IllegalArgumentException(u + ", " + v + " are not adjacent"); } Graph(int expSize);   Graph(Graph org); Atom atom(int i); int degree(int u); List<Edge> edges(int u); int[] neighbors(int u); boolean adjacent(int u, int v); int implHCount(int u); Edge edge(int u, int v); Edge edgeAt(int u, int j); Topology topologyOf(int u); Configuration configurationOf(int u); int order(); int size(); static Graph fromSmiles(String smi); static Graph parse(String smi, boolean strict, Set<String> warnings); String toSmiles(); String toSmiles(int[] visitedAt); Graph aromatic(); Graph resonate(); Graph kekule(); boolean assignable(); Graph permute(int[] p); Iterable<Atom> atoms(); Iterable<Edge> edges(); int getFlags(final int mask); int getFlags(); void setTitle(String title); String getTitle(); Graph sort(EdgeComparator comparator); static final int HAS_AROM; static final int HAS_ATM_STRO; static final int HAS_EXT_STRO; static final int HAS_BND_STRO; static final int HAS_STRO; }