Next: Graph Modification Up: Graphs Previous: Graphs

### Graph Creation

| (graph)

Create and return an undirected, binary, simple graph.

| (graph vlist elist )

If vlist is a Scheme list containing integer, string, and/or symbol Scheme objects, and elist is a scheme list containing sublists of these elements, Create an undirected graph or hypergraph of the appropriate type.

| (graph set <vertex *> mset <edge *>)

Create an undirected graph or hypergraph of the appripriate type with the given vertex and edge sets.

| (graph set <vertex *> set <set <vertex *>>

Create an undirected graph or hypergraph of the appripriate type with the given vertex and edge sets. NOTE: the edge set is not a multiset since the output of (choose s k) is a set of sets. CAN BE FIXED.

| (digraph)

Create and return an undirected, binary, simple graph.

| (digraph vlist elist )

If vlist is a Scheme list containing integer, string, and/or symbol Scheme objects, and elist is a scheme list containing sublists of these elements, Create a directed graph or hypergraph of the appropriate type.

| (digraph set <vertex *> mset <edge *>)

NOT IMPLEMENTED YET.

| (digraph set <vertex *> set <sequence <vertex *>>)

Create a directed graph or hypergraph of the appripriate type with the given vertex and edge sets. NOTE: the edge set is not a multiset since the output of (choose s k) is a set of sets. CAN BE FIXED.

(mbingraph) |
(mubingraph) |
(mdbingraph) |
(mhypergraph) |
(muhypergraph) |
(mdhypergraph) |
(bingraph) |
(ubingraph) |
(dbingraph) |
(hypergraph) |
(uhypergraph) |
(dhypergraph) |

Creates an empty graph of the appropriate type.

| (directed-graph g)

Return g if it is not a directed graph (it is undirected or mixed), otherwise create and return a directed graph which is isomorphic to g except that each edge is directed according to lexicographic ordering of its vertices.

| (multi-graph g)

Return g if it is a multigraph, otherwise create and return a simple graph which is isomorphic to g except that no edge is duplicated.

| (simple-graph g)

Return g if it is not a multigraph, otherwise create and return a multigraph of the corresponding type and isomorphic to g.

| (undirected-graph g)

Return g if it is not an undirected graph, otherwise create and return an undirected graph which is isomorphic to gwhen the directions of the edges are ignored.

Next: Graph Modification Up: Graphs Previous: Graphs