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

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

Filename: kern/kern_scm/graph_scm.cxx

Syntax: (graph:cut-edge? in-graph in-edge)

Arg Types: in-graph graph

in-edge string

Returns: boolean

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


in-graph specifies a graph.


in-edge specifies the edge to be queried.

Example: ; graph:cut-edge?

; Create a simple example

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


we-they them-they we-me us-me"))

;; g1

; them-us they-we"]

; CAREFUL: The order of the graph output may

; not be the same each time.

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

;; g2

(graph:cut-edge? g1 "us-them")

;; #f

(graph:cut-edge? g1 "me-you")

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