A list where each element contains all edges between two nodes, regardless of orientation. The list has names which are node pairs, in lexicographic order, and elements all edges between those nodes.
An instance of the
Should those node pairs with no edges be dropped from the returned list.
The function is currently only implemented for graphs of the
graphNEL-class. The edges in the returned list are
instances of the
A named list of
1 2 3 4 5 6 7 8 9
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.