graph:cut-vertex?
List of: Scheme Extensions
Subjects: Graph Theory
Contents: Kernel

Action: Determines whether or not the specified vertex is a cutting vertex.

Filename: kern/kern_scm/graph_scm.cxx

Syntax: (graph:cut-vertex? in-graph test-vertex)

Arg Types: in-graph graph

test-vertex string | entity |

Returns: boolean

Description: A cutting vertex is vertex whose removal creates more components in the graph than are present when the vertex is not removed.


in-graph specifies a graph.


test-vertex could be either the designation string in the graph or an entity associated with that graph vertex.

Example: ; graph:cut-vertex?

; Create a simple example

(define g1 (graph "me-you us-them


we-they them-they


FIDO-SPOT SPOT-KING SPOT-PETEY"))

;; g1

; CAREFUL: The order of the graph output may

; not be the same each time.

(define g2 (graph:cut-vertices g1))

;; g2

(graph:cut-vertex? g1 "us")

;; #f

(graph:cut-vertex? g1 "SPOT")

;; #t
PDF/KERN/13SCF.PDF
HTM/DATA/KERN/KERN/13SCF/0039.HTM