- (graph-edge (G <multidigraph>) u v id)method
- (graph-edge (G <multigraph>) u v id)method
- (graph-edge (G <digraph>) u v)method
- (graph-edge (G <graph>) u v)method
Returns an alist of the attributes for edge u->v in G. If u->v does not exist in G, an error is raised.
- G
- the graph
- u
- the head vertex
- v
- the tail vertex
- id
- (multigraph-types only) distinguishes which edge amongst multiple edges