## Generic Function Subgraph-Containing (1 method)

(

**subgraph-containing** < graph > < vertex > &key < depth > < new-graph > )

Returns a new graph that is a subset of `graph`

that contains `vertex`

and all of the other vertexes that can be

reached from vertex by paths of less than or equal of length `depth`

.

If depth is not specified, then the entire sub-graph reachable from

vertex will be returned. [?? Edge weights are always assumed to be

one.]

### Method Summary

subgraph-containing < cl-graph:basic-graph > < cl-graph:basic-vertex > |