Bigraph -- a graph with bidirected edges and no multiple edges

Functions and methods returning an object of class Bigraph:

• bigraph -- create a bigraph

Methods that use an object of class Bigraph:

• isLoopless(Bigraph) -- see isLoopless -- check whether a graph contains a loop
• mixedGraph(Bigraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Digraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Digraph,Graph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Graph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Graph,Digraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph,Bigraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph,Bigraph,Graph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph,Graph,Bigraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph,Bigraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph,Bigraph,Digraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph,Digraph,Bigraph) -- see mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph

For the programmer

The object Bigraph is a type, with ancestor classes Graph < Digraph < HashTable < Thing.