MixedGraph -- a graph that has undirected, directed and bidirected edges

Functions and methods returning an object of class MixedGraph :

• collateVertices -- convert a mixed graph into a new mixed graph where each component subgraph has the same set of vertices
• indexLabelGraph(MixedGraph) -- relabel the vertices of a mixed graph according to their indices, indexed from 0
• mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph

Methods that use an object of class MixedGraph :

• bigraph(MixedGraph) -- extract the bigraph component of a mixed graph
• children(MixedGraph,Thing) -- return the children of a vertex of a mixed graph
• collateVertices(MixedGraph) -- see collateVertices -- convert a mixed graph into a new mixed graph where each component subgraph has the same set of vertices
• descendants(MixedGraph,Thing) -- return the descendants of a vertex of a mixed graph
• digraph(MixedGraph) -- extract the digraph component of a mixed graph
• forefathers(MixedGraph,Thing) -- return the forefathers of a vertex of a mixed graph
• graph(MixedGraph) -- convert mixed graph to a hash table
• isCyclic(MixedGraph) -- check whether a mixed graph contains a directed cycle
• isLoopless(MixedGraph) -- see isLoopless -- check whether a graph contains a loop
• isSimple(MixedGraph) -- check whether a mixed graph is simple
• neighbors(MixedGraph,Thing) -- return the neighbors of a vertex of a mixed graph
• net(MixedGraph) -- print a mixed graph as a net
• nondescendants(MixedGraph,Thing) -- return the nondescendents of a vertex of a mixed graph
• nonneighbors(MixedGraph,Thing) -- return the neighbors of a vertex of a mixed graph
• parents(MixedGraph,Thing) -- return the parents of a vertex of a mixed graph
• partitionLMG(MixedGraph) -- see partitionLMG -- partition the vertices of a loopless mixed graph into adjacent to undirected edges and adjacent to bidirected edges
• toString(MixedGraph) -- print a mixed graph as a string
• undirectedGraph(MixedGraph) -- see undirectedGraph -- extract the undirected graph component of a mixed graph
• vertexSet(MixedGraph) -- see vertices(MixedGraph) -- create a union of all vertices of a mixed graph
• vertices(MixedGraph) -- create a union of all vertices of a mixed graph

For the programmer

The object MixedGraph is a type, with ancestor classes HashTable < Thing.