` *depth-first-search-timer* (variable)`

` *dot-edge-attributes* (variable)`

` *dot-graph-attributes* (variable)`

` *dot-path* (variable)`

` *dot-vertex-attributes* (variable)`

` .inv-node-color (function)`

` .inv-node-depth (function)`

` .inv-node-parent (function)`

` edge->dot (generic function)`

` graph->dot (generic function)`

` vertex->dot (generic function)`

` graph->dot-external (generic function)`

` graph->dot-properties (generic function)`

` defpixel-inch-accessors (macro)`

` add-edge (generic function)`

` add-edge-between-vertexes (generic function)`

` add-edge-to-vertex (generic function)`

` add-edges-to-graph (generic function)`

` add-vertex (generic function)`

` adjacentp (generic function)`

` map-over-all-combinations-of-k-edges (generic function)`

` map-over-all-combinations-of-k-vertexes (generic function)`

` delete-all-edges (generic function)`

` tag-all-edges (generic function)`

` untag-all-edges (generic function)`

` any-undirected-cycle-p (generic function)`

` append-unique (function)`

` assign-level (generic function)`

` ensure-valid-dot-attribute (generic function)`

` dot-attribute-value (generic function)`

` format-dot-attributes (function)`

` *dot-edge-attributes* (variable)`

` *dot-graph-attributes* (variable)`

` *dot-vertex-attributes* (variable)`

` dot-attributes-mixin (class)`

` dfs-back-edge-p (generic function)`

` basic-edge (class)`

` basic-graph (class)`

` basic-vertex (class)`

` add-edge-between-vertexes (generic function)`

` delete-edge-between-vertexes (generic function)`

` find-edge-between-vertexes (generic function)`

` find-edge-between-vertexes-if (generic function)`

` project-bipartite-graph (generic function)`

` breadth-first-search-graph (generic function)`

` breadth-first-visitor (generic function)`

` edge-lessp-by-direction (generic function)`

` edge-lessp-by-weight (generic function)`

` with-changing-vertex (macro)`

` child-vertexes (generic function)`

` neighbors-to-children (function)`

` has-children-p (generic function)`

` graph-search-for-cl-graph (function)`

` get-transitive-closure (function)`

` .inv-node-color (function)`

` node-color (function)`

` map-over-all-combinations-of-k-edges (generic function)`

` map-over-all-combinations-of-k-vertexes (generic function)`

` complete-links (generic function)`

` connected-component-count (generic function)`

` connected-components (generic function)`

` find-connected-components (generic function)`

` connected-component-count (generic function)`

` connected-components (generic function)`

` find-connected-components (generic function)`

` connected-graph-p (generic function)`

` graph-container (class)`

` make-edge-container (generic function)`

` make-vertex-container (generic function)`

` make-vertex-edges-container (generic function)`

` graph-container-directed-edge (class)`

` graph-container-edge (class)`

` graph-container-vertex (class)`

` subgraph-containing (generic function)`

` copy-vertex-datum (function)`

` connected-component-count (generic function)`

` edge-count (generic function)`

` source-edge-count (generic function)`

` target-edge-count (generic function)`

` vertex-count (generic function)`

` dfs-cross-edge-p (generic function)`

` any-undirected-cycle-p (generic function)`

` in-cycle-p (generic function)`

` in-undirected-cycle-p (generic function)`

` initialize-vertex-data (generic function)`

` copy-vertex-datum (function)`

` make-vertex-datum (function)`

` defpixel-inch-accessors (macro)`

` delete-all-edges (generic function)`

` delete-edge (generic function)`

` delete-edge-between-vertexes (generic function)`

` delete-vertex (generic function)`

` .inv-node-depth (function)`

` depth (generic function)`

` node-depth (function)`

` dfs (generic function)`

` dfs-back-edge-p (generic function)`

` dfs-cross-edge-p (generic function)`

` dfs-edge-type (generic function)`

` dfs-forward-edge-p (generic function)`

` dfs-tree-edge-p (generic function)`

` dfs-visit (generic function)`

` dot-directed-edge (class)`

` graph-container-directed-edge (class)`

` directed-edge-mixin (class)`

` directed-edge-p (generic function)`

` generate-directed-free-tree (generic function)`

` edge-lessp-by-direction (generic function)`

` write-name-for-dot (generic function)`

` ensure-valid-dot-attribute (generic function)`

` dot-attribute-value (generic function)`

` format-dot-attributes (function)`

` dot-attributes-mixin (class)`

` dot-directed-edge (class)`

` dot-edge (class)`

` dot-edge-mixin (class)`

` dot-graph (class)`

` dot-graph-mixin (class)`

` print-dot-key-value (function)`

` dot-vertex (class)`

` dot-vertex-mixin (class)`

` add-edge (generic function)`

` basic-edge (class)`

` delete-edge (generic function)`

` dot-directed-edge (class)`

` dot-edge (class)`

` find-edge (generic function)`

` graph-container-directed-edge (class)`

` graph-container-edge (class)`

` graph-matrix-edge (class)`

` weighted-edge (class)`

` edge->dot (generic function)`

` *dot-edge-attributes* (variable)`

` add-edge-between-vertexes (generic function)`

` delete-edge-between-vertexes (generic function)`

` find-edge-between-vertexes (generic function)`

` find-edge-between-vertexes-if (generic function)`

` make-edge-container (generic function)`

` edge-count (generic function)`

` source-edge-count (generic function)`

` target-edge-count (generic function)`

` edge-error (condition)`

` graph-vertex-not-found-in-edge-error (condition)`

` make-edge-for-graph (generic function)`

` out-edge-for-vertex-p (generic function)`

` find-edge-if (generic function)`

` edge-lessp-by-direction (generic function)`

` edge-lessp-by-weight (generic function)`

` directed-edge-mixin (class)`

` dot-edge-mixin (class)`

` weighted-edge-mixin (class)`

` graph-edge-not-found-error (condition)`

` dfs-back-edge-p (generic function)`

` dfs-cross-edge-p (generic function)`

` dfs-forward-edge-p (generic function)`

` dfs-tree-edge-p (generic function)`

` directed-edge-p (generic function)`

` tagged-edge-p (generic function)`

` undirected-edge-p (generic function)`

` untagged-edge-p (generic function)`

` vertices-share-edge-p (generic function)`

` add-edge-to-vertex (generic function)`

` dfs-edge-type (generic function)`

` delete-all-edges (generic function)`

` edges (generic function)`

` iterate-edges (generic function)`

` iterate-source-edges (generic function)`

` iterate-target-edges (generic function)`

` map-over-all-combinations-of-k-edges (generic function)`

` renumber-edges (generic function)`

` source-edges (generic function)`

` tag-all-edges (generic function)`

` tag-edges (generic function)`

` target-edges (generic function)`

` untag-all-edges (generic function)`

` untag-edges (generic function)`

` make-vertex-edges-container (generic function)`

` find-edges-if (generic function)`

` add-edges-to-graph (generic function)`

` traverse-elements (generic function)`

` traverse-elements-helper (generic function)`

` ensure-valid-dot-attribute (generic function)`

` edge-error (condition)`

` graph-edge-not-found-error (condition)`

` graph-error (condition)`

` graph-vertex-not-found-error (condition)`

` graph-vertex-not-found-in-edge-error (condition)`

` graph->dot-external (generic function)`

` make-filtered-graph (generic function)`

` find-connected-components (generic function)`

` find-edge (generic function)`

` find-edge-between-vertexes (generic function)`

` find-edge-between-vertexes-if (generic function)`

` find-edge-if (generic function)`

` find-edges-if (generic function)`

` mst-find-set (generic function)`

` find-vertex (generic function)`

` find-vertex-if (generic function)`

` find-vertexes-if (generic function)`

` breadth-first-search-graph (generic function)`

` *depth-first-search-timer* (variable)`

` breadth-first-visitor (generic function)`

` graph-search-for-cl-graph (function)`

` write-name-for-dot (generic function)`

` make-edge-for-graph (generic function)`

` make-vertex-for-graph (generic function)`

` search-for-vertex (generic function)`

` out-edge-for-vertex-p (generic function)`

` force-undirected (generic function)`

` format-dot-attributes (function)`

` dfs-forward-edge-p (generic function)`

` graph-edge-not-found-error (condition)`

` graph-vertex-not-found-error (condition)`

` graph-vertex-not-found-in-edge-error (condition)`

` generate-directed-free-tree (generic function)`

` make-graph-from-vertexes (generic function)`

` generate-directed-free-tree (generic function)`

` get-nodelist-relatives (function)`

` get-transitive-closure (function)`

` add-edges-to-graph (generic function)`

` basic-graph (class)`

` breadth-first-search-graph (generic function)`

` dot-graph (class)`

` graph-search-for-cl-graph (function)`

` make-edge-for-graph (generic function)`

` make-filtered-graph (generic function)`

` make-graph (generic function)`

` make-vertex-for-graph (generic function)`

` project-bipartite-graph (generic function)`

` graph->dot (generic function)`

` graph->dot-external (generic function)`

` graph->dot-properties (generic function)`

` *dot-graph-attributes* (variable)`

` graph-container (class)`

` graph-container-directed-edge (class)`

` graph-container-edge (class)`

` graph-container-vertex (class)`

` graph-edge-not-found-error (condition)`

` graph-error (condition)`

` make-graph-from-vertexes (generic function)`

` graph-matrix (class)`

` graph-matrix-edge (class)`

` graph-matrix-vertex (class)`

` dot-graph-mixin (class)`

` connected-graph-p (generic function)`

` graph-roots (generic function)`

` graph-search-for-cl-graph (function)`

` graph-vertex-not-found-error (condition)`

` graph-vertex-not-found-in-edge-error (condition)`

` has-children-p (generic function)`

` has-parent-p (generic function)`

` height-in-pixels (generic function)`

` traverse-elements-helper (generic function)`

` find-edge-between-vertexes-if (generic function)`

` find-edge-if (generic function)`

` find-edges-if (generic function)`

` find-vertex-if (generic function)`

` find-vertexes-if (generic function)`

` in-cycle-p (generic function)`

` graph-vertex-not-found-in-edge-error (condition)`

` height-in-pixels (generic function)`

` width-in-pixels (generic function)`

` in-undirected-cycle-p (generic function)`

` defpixel-inch-accessors (macro)`

` initialize-vertex-data (generic function)`

` iterate-edges (generic function)`

` iterate-neighbors (generic function)`

` iterate-parents (generic function)`

` iterate-source-edges (generic function)`

` iterate-target-edges (generic function)`

` iterate-vertexes (generic function)`

` map-over-all-combinations-of-k-edges (generic function)`

` map-over-all-combinations-of-k-vertexes (generic function)`

` print-dot-key-value (function)`

` edge-lessp-by-direction (generic function)`

` edge-lessp-by-weight (generic function)`

` assign-level (generic function)`

` mst-link (generic function)`

` complete-links (generic function)`

` remove-list (function)`

` make-edge-container (generic function)`

` make-edge-for-graph (generic function)`

` make-filtered-graph (generic function)`

` make-graph (generic function)`

` make-graph-from-vertexes (generic function)`

` mst-make-set (generic function)`

` make-vertex-container (generic function)`

` make-vertex-datum (function)`

` make-vertex-edges-container (generic function)`

` make-vertex-for-graph (generic function)`

` map-over-all-combinations-of-k-edges (generic function)`

` map-over-all-combinations-of-k-vertexes (generic function)`

` map-paths (function)`

` map-shortest-paths (function)`

` graph-matrix (class)`

` graph-matrix-edge (class)`

` graph-matrix-vertex (class)`

` minimum-spanning-tree (generic function)`

` directed-edge-mixin (class)`

` dot-attributes-mixin (class)`

` dot-edge-mixin (class)`

` dot-graph-mixin (class)`

` dot-vertex-mixin (class)`

` weighted-edge-mixin (class)`

` mst-find-set (generic function)`

` mst-link (generic function)`

` mst-make-set (generic function)`

` mst-tree-union (generic function)`

` write-name-for-dot (generic function)`

` neighbor-vertexes (generic function)`

` iterate-neighbors (generic function)`

` number-of-neighbors (generic function)`

` neighbors-to-children (function)`

` .inv-node-color (function)`

` node-color (function)`

` .inv-node-depth (function)`

` node-depth (function)`

` .inv-node-parent (function)`

` node-parent (function)`

` get-nodelist-relatives (function)`

` graph-edge-not-found-error (condition)`

` graph-vertex-not-found-error (condition)`

` graph-vertex-not-found-in-edge-error (condition)`

` number-of-neighbors (generic function)`

` map-over-all-combinations-of-k-edges (generic function)`

` map-over-all-combinations-of-k-vertexes (generic function)`

` number-of-neighbors (generic function)`

` other-vertex (generic function)`

` out-edge-for-vertex-p (generic function)`

` map-over-all-combinations-of-k-edges (generic function)`

` map-over-all-combinations-of-k-vertexes (generic function)`

` any-undirected-cycle-p (generic function)`

` connected-graph-p (generic function)`

` dfs-back-edge-p (generic function)`

` dfs-cross-edge-p (generic function)`

` dfs-forward-edge-p (generic function)`

` dfs-tree-edge-p (generic function)`

` directed-edge-p (generic function)`

` has-children-p (generic function)`

` has-parent-p (generic function)`

` in-cycle-p (generic function)`

` in-undirected-cycle-p (generic function)`

` out-edge-for-vertex-p (generic function)`

` tagged-edge-p (generic function)`

` undirected-edge-p (generic function)`

` untagged-edge-p (generic function)`

` vertices-share-edge-p (generic function)`

` .inv-node-parent (function)`

` node-parent (function)`

` has-parent-p (generic function)`

` parent-vertexes (generic function)`

` iterate-parents (generic function)`

` *dot-path* (variable)`

` map-paths (function)`

` map-shortest-paths (function)`

` height-in-pixels (generic function)`

` width-in-pixels (generic function)`

` print-dot-key-value (function)`

` project-bipartite-graph (generic function)`

` graph->dot-properties (generic function)`

` get-nodelist-relatives (function)`

` remove-list (function)`

` renumber-edges (generic function)`

` renumber-vertexes (generic function)`

` replace-vertex (generic function)`

` rootp (generic function)`

` graph-roots (generic function)`

` graph-search-for-cl-graph (function)`

` search-for-vertex (generic function)`

` breadth-first-search-graph (generic function)`

` *depth-first-search-timer* (variable)`

` mst-find-set (generic function)`

` mst-make-set (generic function)`

` vertices-share-edge-p (generic function)`

` map-shortest-paths (function)`

` topological-sort (generic function)`

` source-edge-count (generic function)`

` iterate-source-edges (generic function)`

` source-edges (generic function)`

` source-vertex (generic function)`

` minimum-spanning-tree (generic function)`

` subgraph-containing (generic function)`

` tag-all-edges (generic function)`

` tag-edges (generic function)`

` tagged-edge-p (generic function)`

` target-edge-count (generic function)`

` iterate-target-edges (generic function)`

` target-edges (generic function)`

` target-vertex (generic function)`

` textify (function)`

` *depth-first-search-timer* (variable)`

` neighbors-to-children (function)`

` add-edges-to-graph (generic function)`

` add-edge-to-vertex (generic function)`

` topological-sort (generic function)`

` get-transitive-closure (function)`

` traverse-elements (generic function)`

` traverse-elements-helper (generic function)`

` generate-directed-free-tree (generic function)`

` minimum-spanning-tree (generic function)`

` dfs-tree-edge-p (generic function)`

` mst-tree-union (generic function)`

` dfs-edge-type (generic function)`

` force-undirected (generic function)`

` any-undirected-cycle-p (generic function)`

` in-undirected-cycle-p (generic function)`

` undirected-edge-p (generic function)`

` mst-tree-union (generic function)`

` append-unique (function)`

` untag-all-edges (generic function)`

` untag-edges (generic function)`

` untagged-edge-p (generic function)`

` ensure-valid-dot-attribute (generic function)`

` dot-attribute-value (generic function)`

` print-dot-key-value (function)`

` add-edge-to-vertex (generic function)`

` add-vertex (generic function)`

` basic-vertex (class)`

` delete-vertex (generic function)`

` dot-vertex (class)`

` find-vertex (generic function)`

` graph-container-vertex (class)`

` graph-matrix-vertex (class)`

` other-vertex (generic function)`

` replace-vertex (generic function)`

` search-for-vertex (generic function)`

` source-vertex (generic function)`

` target-vertex (generic function)`

` with-changing-vertex (macro)`

` vertex->dot (generic function)`

` *dot-vertex-attributes* (variable)`

` make-vertex-container (generic function)`

` vertex-count (generic function)`

` initialize-vertex-data (generic function)`

` copy-vertex-datum (function)`

` make-vertex-datum (function)`

` make-vertex-edges-container (generic function)`

` make-vertex-for-graph (generic function)`

` find-vertex-if (generic function)`

` dot-vertex-mixin (class)`

` graph-vertex-not-found-error (condition)`

` graph-vertex-not-found-in-edge-error (condition)`

` out-edge-for-vertex-p (generic function)`

` add-edge-between-vertexes (generic function)`

` child-vertexes (generic function)`

` delete-edge-between-vertexes (generic function)`

` find-edge-between-vertexes (generic function)`

` iterate-vertexes (generic function)`

` make-graph-from-vertexes (generic function)`

` map-over-all-combinations-of-k-vertexes (generic function)`

` neighbor-vertexes (generic function)`

` parent-vertexes (generic function)`

` renumber-vertexes (generic function)`

` vertexes (generic function)`

` find-edge-between-vertexes-if (generic function)`

` find-vertexes-if (generic function)`

` vertices-share-edge-p (generic function)`

` dfs-visit (generic function)`

` breadth-first-visitor (generic function)`

` edge-lessp-by-weight (generic function)`

` weighted-edge (class)`

` weighted-edge-mixin (class)`

` width-in-pixels (generic function)`

` with-changing-vertex (macro)`

` write-name-for-dot (generic function)`