1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
# -*- tcl -*-
# Graph ops tests - Adjacency Matrix.
# Copyright (c) 2008 Andreas Kupries <andreas_kupries@users.sourceforge.net>
# All rights reserved.
# RCS: @(#) $Id: adjmatrix.test,v 1.4 2009/09/15 19:24:12 andreas_kupries Exp $
# Syntax: struct::graph::op::toAdjacencyMatrix G
# -------------------------------------------------------------------------
# Wrong # args: Missing, Too many
test graphop-t${treeimpl}-g${impl}-s${setimpl}-st${stkimpl}-q${queimpl}-toAdjacencyMatrix-1.0 {toAdjacencyMatrix, wrong args, missing} {
catch {struct::graph::op::toAdjacencyMatrix} msg
set msg
} [tcltest::wrongNumArgs struct::graph::op::toAdjacencyMatrix {g} 0]
test graphop-t${treeimpl}-g${impl}-s${setimpl}-st${stkimpl}-q${queimpl}-toAdjacencyMatrix-1.1 {toAdjacencyMatrix, wrong args, too many} {
catch {struct::graph::op::toAdjacencyMatrix g x} msg
set msg
} [tcltest::tooManyArgs struct::graph::op::toAdjacencyMatrix {g}]
# -------------------------------------------------------------------------
# Logical arguments checks and failures
# -------------------------------------------------------------------------
# Ok arguments.
test graphop-t${treeimpl}-g${impl}-s${setimpl}-st${stkimpl}-q${queimpl}-toAdjacencyMatrix-2.0 {toAdjacencyMatrix, empty graph} {
SETUP
set result [struct::graph::op::toAdjacencyMatrix mygraph]
mygraph destroy
set result
} {{{}}}
test graphop-t${treeimpl}-g${impl}-s${setimpl}-st${stkimpl}-q${queimpl}-toAdjacencyMatrix-2.1 {toAdjacencyMatrix, nodes, no arcs} {
SETUP
mygraph node insert 0 1 2 3 4 5
set result [struct::graph::op::toAdjacencyMatrix mygraph]
mygraph destroy
set result
} {{{} 0 1 2 3 4 5} {0 0 0 0 0 0 0} {1 0 0 0 0 0 0} {2 0 0 0 0 0 0} {3 0 0 0 0 0 0} {4 0 0 0 0 0 0} {5 0 0 0 0 0 0}}
test graphop-t${treeimpl}-g${impl}-s${setimpl}-st${stkimpl}-q${queimpl}-toAdjacencyMatrix-2.2 {toAdjacencyMatrix, nodes, arcs} {
SETUP
mygraph node insert 0 1 2 3 4 5
mygraph arc insert 0 1 a
mygraph arc insert 2 3 b
mygraph arc insert 4 5 c
set result [struct::graph::op::toAdjacencyMatrix mygraph]
mygraph destroy
set result
} {{{} 0 1 2 3 4 5} {0 0 1 0 0 0 0} {1 1 0 0 0 0 0} {2 0 0 0 1 0 0} {3 0 0 1 0 0 0} {4 0 0 0 0 0 1} {5 0 0 0 0 1 0}}
test graphop-t${treeimpl}-g${impl}-s${setimpl}-st${stkimpl}-q${queimpl}-toAdjacencyMatrix-2.3 {toAdjacencyMatrix, nodes, parallel arcs, loops} {
SETUP
mygraph node insert 0 1 2 3 4 5
mygraph arc insert 0 1 a
mygraph arc insert 0 1 b
mygraph arc insert 2 3 c
mygraph arc insert 3 2 d
mygraph arc insert 4 4 e
set result [struct::graph::op::toAdjacencyMatrix mygraph]
mygraph destroy
set result
} {{{} 0 1 2 3 4 5} {0 0 1 0 0 0 0} {1 1 0 0 0 0 0} {2 0 0 0 1 0 0} {3 0 0 1 0 0 0} {4 0 0 0 0 1 0} {5 0 0 0 0 0 0}}
# ---------------------------------------------------
# ---------------------------------------------------
|
