bigraph -- create a bigraph

Synopsis

Usage:

G= bigraph(H)

G= bigraph(L)

G= bigraph(V,L)

G= bigraph(V,A)

G= bigraph(A)
Inputs:
- H, a hash table, hashtable of edges
- L, a list, list of edges
- V, a list, list of vertices
- A, a matrix, adjacency matrix
Optional inputs:
- EntryMode => ..., default value "auto", optional input, accepts 'auto', 'edges', or 'neighbors'
- Singletons => ..., default value null, optional input, accepts the list of isolated vertices in a bigraph
Outputs:
- an instance of the type Bigraph,

This is a constructor of a simple graph of class Bigraph. One can use the same input types as in graph.

i1 : G = bigraph {{3,4},{1,2},{2,4}}

o1 = Bigraph{1 => {2}   }
             2 => {4, 1}
             3 => {4}
             4 => {3, 2}

o1 : Bigraph