Function Index

.
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
.
Back to top

.inv-node-color

.inv-node-depth

.inv-node-parent

a
Back to top

append-unique

c
Back to top

copy-vertex-datum

f
Back to top

format-dot-attributes

g
Back to top

get-nodelist-relatives

get-transitive-closure

graph-search-for-cl-graph

m
Back to top

make-vertex-datum

map-paths

map-shortest-paths

n
Back to top

neighbors-to-children

node-color

node-depth

node-parent

p
Back to top

print-dot-key-value

r
Back to top

remove-list

t
Back to top

textify

a
Back to top

add-edge

add-edge-between-vertexes

add-edge-to-vertex

add-edges-to-graph

add-vertex

adjacentp

any-undirected-cycle-p

assign-level

b
Back to top

breadth-first-search-graph

breadth-first-visitor

c
Back to top

child-vertexes

complete-links

connected-component-count

connected-components

connected-graph-p

d
Back to top

delete-all-edges

delete-edge

delete-edge-between-vertexes

delete-vertex

depth

dfs

dfs-back-edge-p

dfs-cross-edge-p

dfs-edge-type

dfs-forward-edge-p

dfs-tree-edge-p

dfs-visit

directed-edge-p

dot-attribute-value

e
Back to top

edge->dot

edge-count

edge-lessp-by-direction

edge-lessp-by-weight

edges

ensure-valid-dot-attribute

f
Back to top

find-connected-components

find-edge

find-edge-between-vertexes

find-edge-between-vertexes-if

find-edge-if

find-edges-if

find-vertex

find-vertex-if

find-vertexes-if

force-undirected

g
Back to top

generate-directed-free-tree

graph->dot

graph->dot-external

graph->dot-properties

graph-roots

h
Back to top

has-children-p

has-parent-p

height-in-pixels

i
Back to top

in-cycle-p

in-undirected-cycle-p

initialize-vertex-data

iterate-edges

iterate-neighbors

iterate-parents

iterate-source-edges

iterate-target-edges

iterate-vertexes

m
Back to top

make-edge-container

make-edge-for-graph

make-filtered-graph

make-graph

make-graph-from-vertexes

make-vertex-container

make-vertex-edges-container

make-vertex-for-graph

map-over-all-combinations-of-k-edges

map-over-all-combinations-of-k-vertexes

minimum-spanning-tree

mst-find-set

mst-link

mst-make-set

mst-tree-union

n
Back to top

neighbor-vertexes

number-of-neighbors

o
Back to top

other-vertex

out-edge-for-vertex-p

p
Back to top

parent-vertexes

project-bipartite-graph

r
Back to top

renumber-edges

renumber-vertexes

replace-vertex

rootp

s
Back to top

search-for-vertex

source-edge-count

source-edges

source-vertex

subgraph-containing

t
Back to top

tag-all-edges

tag-edges

tagged-edge-p

target-edge-count

target-edges

target-vertex

topological-sort

traverse-elements

traverse-elements-helper

u
Back to top

undirected-edge-p

untag-all-edges

untag-edges

untagged-edge-p

v
Back to top

vertex->dot

vertex-count

vertexes

vertices-share-edge-p

w
Back to top

width-in-pixels

write-name-for-dot