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

Action: Returns all of the cutting edges of a graph.

Filename: kern/kern_scm/graph_scm.cxx

Syntax: (graph:cut-edges in-graph)

Arg Types: in-graph graph

Returns: graph

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.

Example: ; graph:cut-edges

; Create a simple example

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


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

;; g1

; 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/0038.HTM