chickadee » graphs » graph-adjacent?

(graph-adjacent? (G <multidigraph>) u v [id])method
(graph-adjacent? (G <multigraph>) u v [id])method
(graph-adjacent? (G <digraph>) u v)method
(graph-adjacent? (G <graph>) u v)method

Predicate to check if an edge exists between vertices u and v (in other words, is v adjacent to u?). For multigraph types, an optional id argument can also be passed, to differentiate between multiple edges.

the graph to check
the head vertex
the tail vertex
an optional argument for multigraph-types which allows one to specify which edge you may be looking for (where id is a unique identifier). Passing id when calling this method with a graph type will result in an error.