- graph->sexp:procedure
generates an s-expression description of the given graph, with the following structure:
(graph (name GRAPH-NAME ) (nodes (node (id NODE-ID ) (info NODE-INFO )) ... ) (edges (edge (i EDGE-I-NODE ) (j EDGE-J-NODE ) (info (EDGE-INFO ))) ... ))