/usr/share/tcltk/tcllib1.17/struct/graph1.tcl is in tcllib 1.17-dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 | # graph.tcl --
#
# Implementation of a graph data structure for Tcl.
#
# Copyright (c) 2000 by Andreas Kupries
#
# See the file "license.terms" for information on usage and redistribution
# of this file, and for a DISCLAIMER OF ALL WARRANTIES.
#
# RCS: @(#) $Id: graph1.tcl,v 1.5 2008/08/13 20:30:58 mic42 Exp $
# Create the namespace before determining cgraph vs. tcl
# Otherwise the loading 'struct.tcl' may get into trouble
# when trying to import commands from them
namespace eval ::struct {}
namespace eval ::struct::graph {}
# Try to load the cgraph package
if {![catch {package require cgraph 0.6}]} {
# the cgraph package takes over, so we can return
return
}
namespace eval ::struct {}
namespace eval ::struct::graph {
# Data storage in the graph module
# -------------------------------
#
# There's a lot of bits to keep track of for each graph:
# nodes
# node values
# node relationships (arcs)
# arc values
#
# It would quickly become unwieldy to try to keep these in arrays or lists
# within the graph namespace itself. Instead, each graph structure will
# get its own namespace. Each namespace contains:
# node:$node array mapping keys to values for the node $node
# arc:$arc array mapping keys to values for the arc $arc
# inArcs array mapping nodes to the list of incoming arcs
# outArcs array mapping nodes to the list of outgoing arcs
# arcNodes array mapping arcs to the two nodes (start & end)
# counter is used to give a unique name for unnamed graph
variable counter 0
# commands is the list of subcommands recognized by the graph
variable commands [list \
"arc" \
"arcs" \
"destroy" \
"get" \
"getall" \
"keys" \
"keyexists" \
"node" \
"nodes" \
"set" \
"swap" \
"unset" \
"walk" \
]
variable arcCommands [list \
"append" \
"delete" \
"exists" \
"get" \
"getall" \
"insert" \
"keys" \
"keyexists" \
"lappend" \
"set" \
"source" \
"target" \
"unset" \
]
variable nodeCommands [list \
"append" \
"degree" \
"delete" \
"exists" \
"get" \
"getall" \
"insert" \
"keys" \
"keyexists" \
"lappend" \
"opposite" \
"set" \
"unset" \
]
# Only export one command, the one used to instantiate a new graph
namespace export graph
}
# ::struct::graph::graph --
#
# Create a new graph with a given name; if no name is given, use
# graphX, where X is a number.
#
# Arguments:
# name name of the graph; if null, generate one.
#
# Results:
# name name of the graph created
proc ::struct::graph::graph {{name ""}} {
variable counter
if { [llength [info level 0]] == 1 } {
incr counter
set name "graph${counter}"
}
if { ![string equal [info commands ::$name] ""] } {
error "command \"$name\" already exists, unable to create graph"
}
# Set up the namespace
namespace eval ::struct::graph::graph$name {
# Set up the map for values associated with the graph itself
variable graphData
array set graphData {data ""}
# Set up the map from nodes to the arcs coming to them
variable inArcs
array set inArcs {}
# Set up the map from nodes to the arcs going out from them
variable outArcs
array set outArcs {}
# Set up the map from arcs to the nodes they touch.
variable arcNodes
array set arcNodes {}
# Set up a value for use in creating unique node names
variable nextUnusedNode
set nextUnusedNode 1
# Set up a value for use in creating unique arc names
variable nextUnusedArc
set nextUnusedArc 1
}
# Create the command to manipulate the graph
interp alias {} ::$name {} ::struct::graph::GraphProc $name
return $name
}
##########################
# Private functions follow
# ::struct::graph::GraphProc --
#
# Command that processes all graph object commands.
#
# Arguments:
# name name of the graph object to manipulate.
# args command name and args for the command
#
# Results:
# Varies based on command to perform
proc ::struct::graph::GraphProc {name {cmd ""} args} {
# Do minimal args checks here
if { [llength [info level 0]] == 2 } {
error "wrong # args: should be \"$name option ?arg arg ...?\""
}
# Split the args into command and args components
if { [llength [info commands ::struct::graph::_$cmd]] == 0 } {
variable commands
set optlist [join $commands ", "]
set optlist [linsert $optlist "end-1" "or"]
error "bad option \"$cmd\": must be $optlist"
}
eval [list ::struct::graph::_$cmd $name] $args
}
# ::struct::graph::_arc --
#
# Dispatches the invocation of arc methods to the proper handler
# procedure.
#
# Arguments:
# name name of the graph.
# cmd arc command to invoke
# args arguments to propagate to the handler for the arc command
#
# Results:
# As of the invoked handler.
proc ::struct::graph::_arc {name cmd args} {
# Split the args into command and args components
if { [llength [info commands ::struct::graph::__arc_$cmd]] == 0 } {
variable arcCommands
set optlist [join $arcCommands ", "]
set optlist [linsert $optlist "end-1" "or"]
error "bad option \"$cmd\": must be $optlist"
}
eval [list ::struct::graph::__arc_$cmd $name] $args
}
# ::struct::graph::__arc_delete --
#
# Remove an arc from a graph, including all of its values.
#
# Arguments:
# name name of the graph.
# args list of arcs to delete.
#
# Results:
# None.
proc ::struct::graph::__arc_delete {name args} {
foreach arc $args {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
}
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::outArcs outArcs
upvar ::struct::graph::graph${name}::arcNodes arcNodes
foreach arc $args {
foreach {source target} $arcNodes($arc) break ; # lassign
unset arcNodes($arc)
# FRINK: nocheck
unset ::struct::graph::graph${name}::arc$arc
# Remove arc from the arc lists of source and target nodes.
set index [lsearch -exact $outArcs($source) $arc]
set outArcs($source) [lreplace $outArcs($source) $index $index]
set index [lsearch -exact $inArcs($target) $arc]
set inArcs($target) [lreplace $inArcs($target) $index $index]
}
return
}
# ::struct::graph::__arc_exists --
#
# Test for existance of a given arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to look for.
#
# Results:
# 1 if the arc exists, 0 else.
proc ::struct::graph::__arc_exists {name arc} {
return [info exists ::struct::graph::graph${name}::arcNodes($arc)]
}
# ::struct::graph::__arc_get --
#
# Get a keyed value from an arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to query.
# flag -key; anything else is an error
# key key to lookup; defaults to data
#
# Results:
# value value associated with the key given.
proc ::struct::graph::__arc_get {name arc {flag -key} {key data}} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::arc${arc} data
if { ![info exists data($key)] } {
error "invalid key \"$key\" for arc \"$arc\""
}
return $data($key)
}
# ::struct::graph::__arc_getall --
#
# Get a serialized array of key/value pairs from an arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to query.
#
# Results:
# value serialized array of key/value pairs.
proc ::struct::graph::__arc_getall {name arc args} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
if { [llength $args] } {
error "wrong # args: should be none"
}
upvar ::struct::graph::graph${name}::arc${arc} data
return [array get data]
}
# ::struct::graph::__arc_keys --
#
# Get a list of keys for an arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to query.
#
# Results:
# value value associated with the key given.
proc ::struct::graph::__arc_keys {name arc args} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
if { [llength $args] } {
error "wrong # args: should be none"
}
upvar ::struct::graph::graph${name}::arc${arc} data
return [array names data]
}
# ::struct::graph::__arc_keyexists --
#
# Test for existance of a given key for a given arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to query.
# flag -key; anything else is an error
# key key to lookup; defaults to data
#
# Results:
# 1 if the key exists, 0 else.
proc ::struct::graph::__arc_keyexists {name arc {flag -key} {key data}} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
if { ![string equal $flag "-key"] } {
error "invalid option \"$flag\": should be -key"
}
upvar ::struct::graph::graph${name}::arc${arc} data
return [info exists data($key)]
}
# ::struct::graph::__arc_insert --
#
# Add an arc to a graph.
#
# Arguments:
# name name of the graph.
# source source node of the new arc
# target target node of the new arc
# args arc to insert; must be unique. If none is given,
# the routine will generate a unique node name.
#
# Results:
# arc The name of the new arc.
proc ::struct::graph::__arc_insert {name source target args} {
if { [llength $args] == 0 } {
# No arc name was given; generate a unique one
set arc [__generateUniqueArcName $name]
} else {
set arc [lindex $args 0]
}
if { [__arc_exists $name $arc] } {
error "arc \"$arc\" already exists in graph \"$name\""
}
if { ![__node_exists $name $source] } {
error "source node \"$source\" does not exist in graph \"$name\""
}
if { ![__node_exists $name $target] } {
error "target node \"$target\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::outArcs outArcs
upvar ::struct::graph::graph${name}::arcNodes arcNodes
upvar ::struct::graph::graph${name}::arc${arc} data
# Set up the new arc
set data(data) ""
set arcNodes($arc) [list $source $target]
# Add this arc to the arc lists of its source resp. target nodes.
lappend outArcs($source) $arc
lappend inArcs($target) $arc
return $arc
}
# ::struct::graph::__arc_set --
#
# Set or get a value for an arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to modify or query.
# args ?-key key? ?value?
#
# Results:
# val value associated with the given key of the given arc
proc ::struct::graph::__arc_set {name arc args} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::arc$arc data
if { [llength $args] > 3 } {
error "wrong # args: should be \"$name arc set $arc ?-key key?\
?value?\""
}
set key "data"
set haveValue 0
if { [llength $args] > 1 } {
foreach {flag key} $args break
if { ![string match "${flag}*" "-key"] } {
error "invalid option \"$flag\": should be key"
}
if { [llength $args] == 3 } {
set haveValue 1
set value [lindex $args end]
}
} elseif { [llength $args] == 1 } {
set haveValue 1
set value [lindex $args end]
}
if { $haveValue } {
# Setting a value
return [set data($key) $value]
} else {
# Getting a value
if { ![info exists data($key)] } {
error "invalid key \"$key\" for arc \"$arc\""
}
return $data($key)
}
}
# ::struct::graph::__arc_append --
#
# Append a value for an arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to modify or query.
# args ?-key key? value
#
# Results:
# val value associated with the given key of the given arc
proc ::struct::graph::__arc_append {name arc args} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::arc$arc data
if { [llength $args] != 1 && [llength $args] != 3 } {
error "wrong # args: should be \"$name arc append $arc ?-key key?\
value\""
}
if { [llength $args] == 3 } {
foreach {flag key} $args break
if { ![string equal $flag "-key"] } {
error "invalid option \"$flag\": should be -key"
}
} else {
set key "data"
}
set value [lindex $args end]
return [append data($key) $value]
}
# ::struct::graph::__arc_lappend --
#
# lappend a value for an arc in a graph.
#
# Arguments:
# name name of the graph.
# arc arc to modify or query.
# args ?-key key? value
#
# Results:
# val value associated with the given key of the given arc
proc ::struct::graph::__arc_lappend {name arc args} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::arc$arc data
if { [llength $args] != 1 && [llength $args] != 3 } {
error "wrong # args: should be \"$name arc lappend $arc ?-key key?\
value\""
}
if { [llength $args] == 3 } {
foreach {flag key} $args break
if { ![string equal $flag "-key"] } {
error "invalid option \"$flag\": should be -key"
}
} else {
set key "data"
}
set value [lindex $args end]
return [lappend data($key) $value]
}
# ::struct::graph::__arc_source --
#
# Return the node at the beginning of the specified arc.
#
# Arguments:
# name name of the graph object.
# arc arc to look up.
#
# Results:
# node name of the node.
proc ::struct::graph::__arc_source {name arc} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::arcNodes arcNodes
return [lindex $arcNodes($arc) 0]
}
# ::struct::graph::__arc_target --
#
# Return the node at the end of the specified arc.
#
# Arguments:
# name name of the graph object.
# arc arc to look up.
#
# Results:
# node name of the node.
proc ::struct::graph::__arc_target {name arc} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::arcNodes arcNodes
return [lindex $arcNodes($arc) 1]
}
# ::struct::graph::__arc_unset --
#
# Remove a keyed value from a arc.
#
# Arguments:
# name name of the graph.
# arc arc to modify.
# args additional args: ?-key key?
#
# Results:
# None.
proc ::struct::graph::__arc_unset {name arc {flag -key} {key data}} {
if { ![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
if { ![string match "${flag}*" "-key"] } {
error "invalid option \"$flag\": should be \"$name arc unset\
$arc ?-key key?\""
}
upvar ::struct::graph::graph${name}::arc${arc} data
if { [info exists data($key)] } {
unset data($key)
}
return
}
# ::struct::graph::_arcs --
#
# Return a list of all arcs in a graph satisfying some
# node based restriction.
#
# Arguments:
# name name of the graph.
#
# Results:
# arcs list of arcs
proc ::struct::graph::_arcs {name args} {
# Discriminate between conditions and nodes
set haveCond 0
set haveKey 0
set haveValue 0
set cond "none"
set condNodes [list]
for {set i 0} {$i < [llength $args]} {incr i} {
set arg [lindex $args $i]
switch -glob -- $arg {
-in -
-out -
-adj -
-inner -
-embedding {
if {$haveCond} {
return -code error "invalid restriction:\
illegal multiple use of\
\"-in\"|\"-out\"|\"-adj\"|\"-inner\"|\"-embedding\""
}
set haveCond 1
set cond [string range $arg 1 end]
}
-key {
if {$haveKey} {
return -code error {invalid restriction: illegal multiple use of "-key"}
}
incr i
set key [lindex $args $i]
set haveKey 1
}
-value {
if {$haveValue} {
return -code error {invalid restriction: illegal multiple use of "-value"}
}
incr i
set value [lindex $args $i]
set haveValue 1
}
-* {
error "invalid restriction \"$arg\": should be -in, -out,\
-adj, -inner, -embedding, -key or -value"
}
default {
lappend condNodes $arg
}
}
}
# Validate that there are nodes to use in the restriction.
# otherwise what's the point?
if {$haveCond} {
if {[llength $condNodes] == 0} {
set usage "$name arcs ?-key key? ?-value value? ?-in|-out|-adj|-inner|-embedding node node...?"
error "no nodes specified: should be \"$usage\""
}
# Make sure that the specified nodes exist!
foreach node $condNodes {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
}
}
# Now we are able to go to work
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::outArcs outArcs
upvar ::struct::graph::graph${name}::arcNodes arcNodes
set arcs [list]
switch -exact -- $cond {
in {
# Result is all arcs going to at least one node
# in the list of arguments.
foreach node $condNodes {
foreach e $inArcs($node) {
# As an arc has only one destination, i.e. is the
# in-arc of exactly one node it is impossible to
# count an arc twice. IOW the [info exists] below
# is never true. Found through coverage analysis
# and then trying to think up a testcase invoking
# the continue.
# if {[info exists coll($e)]} {continue}
lappend arcs $e
#set coll($e) .
}
}
}
out {
# Result is all arcs coming from at least one node
# in the list of arguments.
foreach node $condNodes {
foreach e $outArcs($node) {
# See above 'in', same reasoning, one source per arc.
# if {[info exists coll($e)]} {continue}
lappend arcs $e
#set coll($e) .
}
}
}
adj {
# Result is all arcs coming from or going to at
# least one node in the list of arguments.
array set coll {}
# Here we do need 'coll' as each might be an in- and
# out-arc for one or two nodes in the list of arguments.
foreach node $condNodes {
foreach e $inArcs($node) {
if {[info exists coll($e)]} {continue}
lappend arcs $e
set coll($e) .
}
foreach e $outArcs($node) {
if {[info exists coll($e)]} {continue}
lappend arcs $e
set coll($e) .
}
}
}
inner {
# Result is all arcs running between nodes in the list.
array set coll {}
# Here we do need 'coll' as each might be an in- and
# out-arc for one or two nodes in the list of arguments.
array set group {}
foreach node $condNodes {
set group($node) .
}
foreach node $condNodes {
foreach e $inArcs($node) {
set n [lindex $arcNodes($e) 0]
if {![info exists group($n)]} {continue}
if { [info exists coll($e)]} {continue}
lappend arcs $e
set coll($e) .
}
foreach e $outArcs($node) {
set n [lindex $arcNodes($e) 1]
if {![info exists group($n)]} {continue}
if { [info exists coll($e)]} {continue}
lappend arcs $e
set coll($e) .
}
}
}
embedding {
# Result is all arcs from -adj minus the arcs from -inner.
# IOW all arcs going from a node in the list to a node
# which is *not* in the list
# This also means that no arc can be counted twice as it
# is either going to a node, or coming from a node in the
# list, but it can't do both, because then it is part of
# -inner, which was excluded!
array set group {}
foreach node $condNodes {
set group($node) .
}
foreach node $condNodes {
foreach e $inArcs($node) {
set n [lindex $arcNodes($e) 0]
if {[info exists group($n)]} {continue}
# if {[info exists coll($e)]} {continue}
lappend arcs $e
# set coll($e) .
}
foreach e $outArcs($node) {
set n [lindex $arcNodes($e) 1]
if {[info exists group($n)]} {continue}
# if {[info exists coll($e)]} {continue}
lappend arcs $e
# set coll($e) .
}
}
}
none {
set arcs [array names arcNodes]
}
default {error "Can't happen, panic"}
}
#
# We have a list of arcs that match the relation to the nodes.
# Now filter according to -key and -value.
#
set filteredArcs [list]
if {$haveKey} {
foreach arc $arcs {
catch {
set aval [__arc_get $name $arc -key $key]
if {$haveValue} {
if {$aval == $value} {
lappend filteredArcs $arc
}
} else {
lappend filteredArcs $arc
}
}
}
} else {
set filteredArcs $arcs
}
return $filteredArcs
}
# ::struct::graph::_destroy --
#
# Destroy a graph, including its associated command and data storage.
#
# Arguments:
# name name of the graph.
#
# Results:
# None.
proc ::struct::graph::_destroy {name} {
namespace delete ::struct::graph::graph$name
interp alias {} ::$name {}
}
# ::struct::graph::__generateUniqueArcName --
#
# Generate a unique arc name for the given graph.
#
# Arguments:
# name name of the graph.
#
# Results:
# arc name of a arc guaranteed to not exist in the graph.
proc ::struct::graph::__generateUniqueArcName {name} {
upvar ::struct::graph::graph${name}::nextUnusedArc nextUnusedArc
while {[__arc_exists $name "arc${nextUnusedArc}"]} {
incr nextUnusedArc
}
return "arc${nextUnusedArc}"
}
# ::struct::graph::__generateUniqueNodeName --
#
# Generate a unique node name for the given graph.
#
# Arguments:
# name name of the graph.
#
# Results:
# node name of a node guaranteed to not exist in the graph.
proc ::struct::graph::__generateUniqueNodeName {name} {
upvar ::struct::graph::graph${name}::nextUnusedNode nextUnusedNode
while {[__node_exists $name "node${nextUnusedNode}"]} {
incr nextUnusedNode
}
return "node${nextUnusedNode}"
}
# ::struct::graph::_get --
#
# Get a keyed value from the graph itself
#
# Arguments:
# name name of the graph.
# flag -key; anything else is an error
# key key to lookup; defaults to data
#
# Results:
# value value associated with the key given.
proc ::struct::graph::_get {name {flag -key} {key data}} {
upvar ::struct::graph::graph${name}::graphData data
if { ![info exists data($key)] } {
error "invalid key \"$key\" for graph \"$name\""
}
return $data($key)
}
# ::struct::graph::_getall --
#
# Get a serialized list of key/value pairs from a graph.
#
# Arguments:
# name name of the graph.
#
# Results:
# value value associated with the key given.
proc ::struct::graph::_getall {name args} {
if { [llength $args] } {
error "wrong # args: should be none"
}
upvar ::struct::graph::graph${name}::graphData data
return [array get data]
}
# ::struct::graph::_keys --
#
# Get a list of keys from a graph.
#
# Arguments:
# name name of the graph.
#
# Results:
# value list of known keys
proc ::struct::graph::_keys {name args} {
if { [llength $args] } {
error "wrong # args: should be none"
}
upvar ::struct::graph::graph${name}::graphData data
return [array names data]
}
# ::struct::graph::_keyexists --
#
# Test for existance of a given key in a graph.
#
# Arguments:
# name name of the graph.
# flag -key; anything else is an error
# key key to lookup; defaults to data
#
# Results:
# 1 if the key exists, 0 else.
proc ::struct::graph::_keyexists {name {flag -key} {key data}} {
if { ![string equal $flag "-key"] } {
error "invalid option \"$flag\": should be -key"
}
upvar ::struct::graph::graph${name}::graphData data
return [info exists data($key)]
}
# ::struct::graph::_node --
#
# Dispatches the invocation of node methods to the proper handler
# procedure.
#
# Arguments:
# name name of the graph.
# cmd node command to invoke
# args arguments to propagate to the handler for the node command
#
# Results:
# As of the the invoked handler.
proc ::struct::graph::_node {name cmd args} {
# Split the args into command and args components
if { [llength [info commands ::struct::graph::__node_$cmd]] == 0 } {
variable nodeCommands
set optlist [join $nodeCommands ", "]
set optlist [linsert $optlist "end-1" "or"]
error "bad option \"$cmd\": must be $optlist"
}
eval [list ::struct::graph::__node_$cmd $name] $args
}
# ::struct::graph::__node_degree --
#
# Return the number of arcs adjacent to the specified node.
# If one of the restrictions -in or -out is given only
# incoming resp. outgoing arcs are counted.
#
# Arguments:
# name name of the graph.
# args option, followed by the node.
#
# Results:
# None.
proc ::struct::graph::__node_degree {name args} {
if {([llength $args] < 1) || ([llength $args] > 2)} {
error "wrong # args: should be \"$name node degree ?-in|-out? node\""
}
switch -exact -- [llength $args] {
1 {
set opt {}
set node [lindex $args 0]
}
2 {
set opt [lindex $args 0]
set node [lindex $args 1]
}
default {error "Can't happen, panic"}
}
# Validate the option.
switch -exact -- $opt {
{} -
-in -
-out {}
default {
error "invalid option \"$opt\": should be -in or -out"
}
}
# Validate the node
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::outArcs outArcs
switch -exact -- $opt {
-in {
set result [llength $inArcs($node)]
}
-out {
set result [llength $outArcs($node)]
}
{} {
set result [expr {[llength $inArcs($node)] \
+ [llength $outArcs($node)]}]
# loops count twice, don't do <set> arithmetics, i.e. no union!
if {0} {
array set coll {}
set result [llength $inArcs($node)]
foreach e $inArcs($node) {
set coll($e) .
}
foreach e $outArcs($node) {
if {[info exists coll($e)]} {continue}
incr result
set coll($e) .
}
}
}
default {error "Can't happen, panic"}
}
return $result
}
# ::struct::graph::__node_delete --
#
# Remove a node from a graph, including all of its values.
# Additionally removes the arcs connected to this node.
#
# Arguments:
# name name of the graph.
# args list of the nodes to delete.
#
# Results:
# None.
proc ::struct::graph::__node_delete {name args} {
foreach node $args {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
}
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::outArcs outArcs
foreach node $args {
# Remove all the arcs connected to this node
foreach e $inArcs($node) {
__arc_delete $name $e
}
foreach e $outArcs($node) {
# Check existence to avoid problems with
# loops (they are in and out arcs! at
# the same time and thus already deleted)
if { [__arc_exists $name $e] } {
__arc_delete $name $e
}
}
unset inArcs($node)
unset outArcs($node)
# FRINK: nocheck
unset ::struct::graph::graph${name}::node$node
}
return
}
# ::struct::graph::__node_exists --
#
# Test for existance of a given node in a graph.
#
# Arguments:
# name name of the graph.
# node node to look for.
#
# Results:
# 1 if the node exists, 0 else.
proc ::struct::graph::__node_exists {name node} {
return [info exists ::struct::graph::graph${name}::inArcs($node)]
}
# ::struct::graph::__node_get --
#
# Get a keyed value from a node in a graph.
#
# Arguments:
# name name of the graph.
# node node to query.
# flag -key; anything else is an error
# key key to lookup; defaults to data
#
# Results:
# value value associated with the key given.
proc ::struct::graph::__node_get {name node {flag -key} {key data}} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::node${node} data
if { ![info exists data($key)] } {
error "invalid key \"$key\" for node \"$node\""
}
return $data($key)
}
# ::struct::graph::__node_getall --
#
# Get a serialized list of key/value pairs from a node in a graph.
#
# Arguments:
# name name of the graph.
# node node to query.
#
# Results:
# value value associated with the key given.
proc ::struct::graph::__node_getall {name node args} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
if { [llength $args] } {
error "wrong # args: should be none"
}
upvar ::struct::graph::graph${name}::node${node} data
return [array get data]
}
# ::struct::graph::__node_keys --
#
# Get a list of keys from a node in a graph.
#
# Arguments:
# name name of the graph.
# node node to query.
#
# Results:
# value value associated with the key given.
proc ::struct::graph::__node_keys {name node args} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
if { [llength $args] } {
error "wrong # args: should be none"
}
upvar ::struct::graph::graph${name}::node${node} data
return [array names data]
}
# ::struct::graph::__node_keyexists --
#
# Test for existance of a given key for a node in a graph.
#
# Arguments:
# name name of the graph.
# node node to query.
# flag -key; anything else is an error
# key key to lookup; defaults to data
#
# Results:
# 1 if the key exists, 0 else.
proc ::struct::graph::__node_keyexists {name node {flag -key} {key data}} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
if { ![string equal $flag "-key"] } {
error "invalid option \"$flag\": should be -key"
}
upvar ::struct::graph::graph${name}::node${node} data
return [info exists data($key)]
}
# ::struct::graph::__node_insert --
#
# Add a node to a graph.
#
# Arguments:
# name name of the graph.
# args node to insert; must be unique. If none is given,
# the routine will generate a unique node name.
#
# Results:
# node The namee of the new node.
proc ::struct::graph::__node_insert {name args} {
if { [llength $args] == 0 } {
# No node name was given; generate a unique one
set node [__generateUniqueNodeName $name]
} else {
set node [lindex $args 0]
}
if { [__node_exists $name $node] } {
error "node \"$node\" already exists in graph \"$name\""
}
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::outArcs outArcs
upvar ::struct::graph::graph${name}::node${node} data
# Set up the new node
set inArcs($node) [list]
set outArcs($node) [list]
set data(data) ""
return $node
}
# ::struct::graph::__node_opposite --
#
# Retrieve node opposite to the specified one, along the arc.
#
# Arguments:
# name name of the graph.
# node node to look up.
# arc arc to look up.
#
# Results:
# nodex Node opposite to <node,arc>
proc ::struct::graph::__node_opposite {name node arc} {
if {![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
if {![__arc_exists $name $arc] } {
error "arc \"$arc\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::arcNodes arcNodes
# Node must be connected to at least one end of the arc.
if {[string equal $node [lindex $arcNodes($arc) 0]]} {
set result [lindex $arcNodes($arc) 1]
} elseif {[string equal $node [lindex $arcNodes($arc) 1]]} {
set result [lindex $arcNodes($arc) 0]
} else {
error "node \"$node\" and arc \"$arc\" are not connected\
in graph \"$name\""
}
return $result
}
# ::struct::graph::__node_set --
#
# Set or get a value for a node in a graph.
#
# Arguments:
# name name of the graph.
# node node to modify or query.
# args ?-key key? ?value?
#
# Results:
# val value associated with the given key of the given node
proc ::struct::graph::__node_set {name node args} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::node$node data
if { [llength $args] > 3 } {
error "wrong # args: should be \"$name node set $node ?-key key?\
?value?\""
}
set key "data"
set haveValue 0
if { [llength $args] > 1 } {
foreach {flag key} $args break
if { ![string match "${flag}*" "-key"] } {
error "invalid option \"$flag\": should be key"
}
if { [llength $args] == 3 } {
set haveValue 1
set value [lindex $args end]
}
} elseif { [llength $args] == 1 } {
set haveValue 1
set value [lindex $args end]
}
if { $haveValue } {
# Setting a value
return [set data($key) $value]
} else {
# Getting a value
if { ![info exists data($key)] } {
error "invalid key \"$key\" for node \"$node\""
}
return $data($key)
}
}
# ::struct::graph::__node_append --
#
# Append a value for a node in a graph.
#
# Arguments:
# name name of the graph.
# node node to modify or query.
# args ?-key key? value
#
# Results:
# val value associated with the given key of the given node
proc ::struct::graph::__node_append {name node args} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::node$node data
if { [llength $args] != 1 && [llength $args] != 3 } {
error "wrong # args: should be \"$name node append $node ?-key key?\
value\""
}
if { [llength $args] == 3 } {
foreach {flag key} $args break
if { ![string equal $flag "-key"] } {
error "invalid option \"$flag\": should be -key"
}
} else {
set key "data"
}
set value [lindex $args end]
return [append data($key) $value]
}
# ::struct::graph::__node_lappend --
#
# lappend a value for a node in a graph.
#
# Arguments:
# name name of the graph.
# node node to modify or query.
# args ?-key key? value
#
# Results:
# val value associated with the given key of the given node
proc ::struct::graph::__node_lappend {name node args} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
upvar ::struct::graph::graph${name}::node$node data
if { [llength $args] != 1 && [llength $args] != 3 } {
error "wrong # args: should be \"$name node lappend $node ?-key key?\
value\""
}
if { [llength $args] == 3 } {
foreach {flag key} $args break
if { ![string equal $flag "-key"] } {
error "invalid option \"$flag\": should be -key"
}
} else {
set key "data"
}
set value [lindex $args end]
return [lappend data($key) $value]
}
# ::struct::graph::__node_unset --
#
# Remove a keyed value from a node.
#
# Arguments:
# name name of the graph.
# node node to modify.
# args additional args: ?-key key?
#
# Results:
# None.
proc ::struct::graph::__node_unset {name node {flag -key} {key data}} {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
if { ![string match "${flag}*" "-key"] } {
error "invalid option \"$flag\": should be \"$name node unset\
$node ?-key key?\""
}
upvar ::struct::graph::graph${name}::node${node} data
if { [info exists data($key)] } {
unset data($key)
}
return
}
# ::struct::graph::_nodes --
#
# Return a list of all nodes in a graph satisfying some restriction.
#
# Arguments:
# name name of the graph.
# args list of options and nodes specifying the restriction.
#
# Results:
# nodes list of nodes
proc ::struct::graph::_nodes {name args} {
# Discriminate between conditions and nodes
set haveCond 0
set haveKey 0
set haveValue 0
set cond "none"
set condNodes [list]
for {set i 0} {$i < [llength $args]} {incr i} {
set arg [lindex $args $i]
switch -glob -- $arg {
-in -
-out -
-adj -
-inner -
-embedding {
if {$haveCond} {
return -code error "invalid restriction:\
illegal multiple use of\
\"-in\"|\"-out\"|\"-adj\"|\"-inner\"|\"-embedding\""
}
set haveCond 1
set cond [string range $arg 1 end]
}
-key {
if {$haveKey} {
return -code error {invalid restriction: illegal multiple use of "-key"}
}
incr i
set key [lindex $args $i]
set haveKey 1
}
-value {
if {$haveValue} {
return -code error {invalid restriction: illegal multiple use of "-value"}
}
incr i
set value [lindex $args $i]
set haveValue 1
}
-* {
error "invalid restriction \"$arg\": should be -in, -out,\
-adj, -inner, -embedding, -key or -value"
}
default {
lappend condNodes $arg
}
}
}
# Validate that there are nodes to use in the restriction.
# otherwise what's the point?
if {$haveCond} {
if {[llength $condNodes] == 0} {
set usage "$name nodes ?-key key? ?-value value? ?-in|-out|-adj|-inner|-embedding node node...?"
error "no nodes specified: should be \"$usage\""
}
# Make sure that the specified nodes exist!
foreach node $condNodes {
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
}
}
# Now we are able to go to work
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::outArcs outArcs
upvar ::struct::graph::graph${name}::arcNodes arcNodes
set nodes [list]
array set coll {}
switch -exact -- $cond {
in {
# Result is all nodes with at least one arc going to
# at least one node in the list of arguments.
foreach node $condNodes {
foreach e $inArcs($node) {
set n [lindex $arcNodes($e) 0]
if {[info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
}
}
out {
# Result is all nodes with at least one arc coming from
# at least one node in the list of arguments.
foreach node $condNodes {
foreach e $outArcs($node) {
set n [lindex $arcNodes($e) 1]
if {[info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
}
}
adj {
# Result is all nodes with at least one arc coming from
# or going to at least one node in the list of arguments.
foreach node $condNodes {
foreach e $inArcs($node) {
set n [lindex $arcNodes($e) 0]
if {[info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
foreach e $outArcs($node) {
set n [lindex $arcNodes($e) 1]
if {[info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
}
}
inner {
# Result is all nodes from the list! with at least one arc
# coming from or going to at least one node in the list of
# arguments.
array set group {}
foreach node $condNodes {
set group($node) .
}
foreach node $condNodes {
foreach e $inArcs($node) {
set n [lindex $arcNodes($e) 0]
if {![info exists group($n)]} {continue}
if { [info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
foreach e $outArcs($node) {
set n [lindex $arcNodes($e) 1]
if {![info exists group($n)]} {continue}
if { [info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
}
}
embedding {
# Result is all nodes with at least one arc coming from
# or going to at least one node in the list of arguments,
# but not in the list itself!
array set group {}
foreach node $condNodes {
set group($node) .
}
foreach node $condNodes {
foreach e $inArcs($node) {
set n [lindex $arcNodes($e) 0]
if {[info exists group($n)]} {continue}
if {[info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
foreach e $outArcs($node) {
set n [lindex $arcNodes($e) 1]
if {[info exists group($n)]} {continue}
if {[info exists coll($n)]} {continue}
lappend nodes $n
set coll($n) .
}
}
}
none {
set nodes [array names inArcs]
}
default {error "Can't happen, panic"}
}
#
# We have a list of nodes that match the relation to the nodes.
# Now filter according to -key and -value.
#
set filteredNodes [list]
if {$haveKey} {
foreach node $nodes {
catch {
set nval [__node_get $name $node -key $key]
if {$haveValue} {
if {$nval == $value} {
lappend filteredNodes $node
}
} else {
lappend filteredNodes $node
}
}
}
} else {
set filteredNodes $nodes
}
return $filteredNodes
}
# ::struct::graph::_set --
#
# Set or get a keyed value from the graph itself
#
# Arguments:
# name name of the graph.
# flag -key; anything else is an error
# args ?-key key? ?value?
#
# Results:
# value value associated with the key given.
proc ::struct::graph::_set {name args} {
upvar ::struct::graph::graph${name}::graphData data
if { [llength $args] > 3 } {
error "wrong # args: should be \"$name set ?-key key?\
?value?\""
}
set key "data"
set haveValue 0
if { [llength $args] > 1 } {
foreach {flag key} $args break
if { ![string match "${flag}*" "-key"] } {
error "invalid option \"$flag\": should be key"
}
if { [llength $args] == 3 } {
set haveValue 1
set value [lindex $args end]
}
} elseif { [llength $args] == 1 } {
set haveValue 1
set value [lindex $args end]
}
if { $haveValue } {
# Setting a value
return [set data($key) $value]
} else {
# Getting a value
if { ![info exists data($key)] } {
error "invalid key \"$key\" for graph \"$name\""
}
return $data($key)
}
}
# ::struct::graph::_swap --
#
# Swap two nodes in a graph.
#
# Arguments:
# name name of the graph.
# node1 first node to swap.
# node2 second node to swap.
#
# Results:
# None.
proc ::struct::graph::_swap {name node1 node2} {
# Can only swap two real nodes
if { ![__node_exists $name $node1] } {
error "node \"$node1\" does not exist in graph \"$name\""
}
if { ![__node_exists $name $node2] } {
error "node \"$node2\" does not exist in graph \"$name\""
}
# Can't swap a node with itself
if { [string equal $node1 $node2] } {
error "cannot swap node \"$node1\" with itself"
}
# Swapping nodes means swapping their labels, values and arcs
upvar ::struct::graph::graph${name}::outArcs outArcs
upvar ::struct::graph::graph${name}::inArcs inArcs
upvar ::struct::graph::graph${name}::arcNodes arcNodes
upvar ::struct::graph::graph${name}::node${node1} node1Vals
upvar ::struct::graph::graph${name}::node${node2} node2Vals
# Redirect arcs to the new nodes.
foreach e $inArcs($node1) {
set arcNodes($e) [lreplace $arcNodes($e) end end $node2]
}
foreach e $inArcs($node2) {
set arcNodes($e) [lreplace $arcNodes($e) end end $node1]
}
foreach e $outArcs($node1) {
set arcNodes($e) [lreplace $arcNodes($e) 0 0 $node2]
}
foreach e $outArcs($node2) {
set arcNodes($e) [lreplace $arcNodes($e) 0 0 $node1]
}
# Swap arc lists
set tmp $inArcs($node1)
set inArcs($node1) $inArcs($node2)
set inArcs($node2) $tmp
set tmp $outArcs($node1)
set outArcs($node1) $outArcs($node2)
set outArcs($node2) $tmp
# Swap the values
set value1 [array get node1Vals]
unset node1Vals
array set node1Vals [array get node2Vals]
unset node2Vals
array set node2Vals $value1
return
}
# ::struct::graph::_unset --
#
# Remove a keyed value from the graph itself
#
# Arguments:
# name name of the graph.
# flag -key; anything else is an error
# args additional args: ?-key key?
#
# Results:
# None.
proc ::struct::graph::_unset {name {flag -key} {key data}} {
upvar ::struct::graph::graph${name}::graphData data
if { ![string match "${flag}*" "-key"] } {
error "invalid option \"$flag\": should be \"$name unset\
?-key key?\""
}
if { [info exists data($key)] } {
unset data($key)
}
return
}
# ::struct::graph::_walk --
#
# Walk a graph using a pre-order depth or breadth first
# search. Pre-order DFS is the default. At each node that is visited,
# a command will be called with the name of the graph and the node.
#
# Arguments:
# name name of the graph.
# node node at which to start.
# args additional args: ?-order pre|post|both? ?-type {bfs|dfs}?
# -command cmd
#
# Results:
# None.
proc ::struct::graph::_walk {name node args} {
set usage "$name walk $node ?-dir forward|backward?\
?-order pre|post|both? ?-type {bfs|dfs}? -command cmd"
if {[llength $args] > 8 || [llength $args] < 2} {
error "wrong # args: should be \"$usage\""
}
if { ![__node_exists $name $node] } {
error "node \"$node\" does not exist in graph \"$name\""
}
# Set defaults
set type dfs
set order pre
set cmd ""
set dir forward
# Process specified options
for {set i 0} {$i < [llength $args]} {incr i} {
set flag [lindex $args $i]
incr i
if { $i >= [llength $args] } {
error "value for \"$flag\" missing: should be \"$usage\""
}
switch -glob -- $flag {
"-type" {
set type [string tolower [lindex $args $i]]
}
"-order" {
set order [string tolower [lindex $args $i]]
}
"-command" {
set cmd [lindex $args $i]
}
"-dir" {
set dir [string tolower [lindex $args $i]]
}
default {
error "unknown option \"$flag\": should be \"$usage\""
}
}
}
# Make sure we have a command to run, otherwise what's the point?
if { [string equal $cmd ""] } {
error "no command specified: should be \"$usage\""
}
# Validate that the given type is good
switch -glob -- $type {
"dfs" {
set type "dfs"
}
"bfs" {
set type "bfs"
}
default {
error "invalid search type \"$type\": should be dfs, or bfs"
}
}
# Validate that the given order is good
switch -glob -- $order {
"both" {
set order both
}
"pre" {
set order pre
}
"post" {
set order post
}
default {
error "invalid search order \"$order\": should be both,\
pre or post"
}
}
# Validate that the given direction is good
switch -glob -- $dir {
"forward" {
set dir -out
}
"backward" {
set dir -in
}
default {
error "invalid search direction \"$dir\": should be\
forward or backward"
}
}
# Do the walk
set st [list ]
lappend st $node
array set visited {}
if { [string equal $type "dfs"] } {
if { [string equal $order "pre"] } {
# Pre-order Depth-first search
while { [llength $st] > 0 } {
set node [lindex $st end]
set st [lreplace $st end end]
# Evaluate the command at this node
set cmdcpy $cmd
lappend cmdcpy enter $name $node
uplevel 2 $cmdcpy
set visited($node) .
# Add this node's neighbours (according to direction)
# Have to add them in reverse order
# so that they will be popped left-to-right
set next [_nodes $name $dir $node]
set len [llength $next]
for {set i [expr {$len - 1}]} {$i >= 0} {incr i -1} {
set nextnode [lindex $next $i]
if {[info exists visited($nextnode)]} {
# Skip nodes already visited
continue
}
lappend st $nextnode
}
}
} elseif { [string equal $order "post"] } {
# Post-order Depth-first search
while { [llength $st] > 0 } {
set node [lindex $st end]
if {[info exists visited($node)]} {
# Second time we are here, pop it,
# then evaluate the command.
set st [lreplace $st end end]
# Evaluate the command at this node
set cmdcpy $cmd
lappend cmdcpy leave $name $node
uplevel 2 $cmdcpy
} else {
# First visit. Remember it.
set visited($node) .
# Add this node's neighbours.
set next [_nodes $name $dir $node]
set len [llength $next]
for {set i [expr {$len - 1}]} {$i >= 0} {incr i -1} {
set nextnode [lindex $next $i]
if {[info exists visited($nextnode)]} {
# Skip nodes already visited
continue
}
lappend st $nextnode
}
}
}
} else {
# Both-order Depth-first search
while { [llength $st] > 0 } {
set node [lindex $st end]
if {[info exists visited($node)]} {
# Second time we are here, pop it,
# then evaluate the command.
set st [lreplace $st end end]
# Evaluate the command at this node
set cmdcpy $cmd
lappend cmdcpy leave $name $node
uplevel 2 $cmdcpy
} else {
# First visit. Remember it.
set visited($node) .
# Evaluate the command at this node
set cmdcpy $cmd
lappend cmdcpy enter $name $node
uplevel 2 $cmdcpy
# Add this node's neighbours.
set next [_nodes $name $dir $node]
set len [llength $next]
for {set i [expr {$len - 1}]} {$i >= 0} {incr i -1} {
set nextnode [lindex $next $i]
if {[info exists visited($nextnode)]} {
# Skip nodes already visited
continue
}
lappend st $nextnode
}
}
}
}
} else {
if { [string equal $order "pre"] } {
# Pre-order Breadth first search
while { [llength $st] > 0 } {
set node [lindex $st 0]
set st [lreplace $st 0 0]
# Evaluate the command at this node
set cmdcpy $cmd
lappend cmdcpy enter $name $node
uplevel 2 $cmdcpy
set visited($node) .
# Add this node's neighbours.
foreach child [_nodes $name $dir $node] {
if {[info exists visited($child)]} {
# Skip nodes already visited
continue
}
lappend st $child
}
}
} else {
# Post-order Breadth first search
# Both-order Breadth first search
# Haven't found anything in Knuth
# and unable to define something
# consistent for myself. Leave it
# out.
error "unable to do a ${order}-order breadth first walk"
}
}
return
}
# ::struct::graph::Union --
#
# Return a list which is the union of the elements
# in the specified lists.
#
# Arguments:
# args list of lists representing sets.
#
# Results:
# set list representing the union of the argument lists.
proc ::struct::graph::Union {args} {
switch -- [llength $args] {
0 {
return {}
}
1 {
return [lindex $args 0]
}
default {
foreach set $args {
foreach e $set {
set tmp($e) .
}
}
return [array names tmp]
}
}
}
# ### ### ### ######### ######### #########
## Ready
namespace eval ::struct {
# Get 'graph::graph' into the general structure namespace.
namespace import -force graph::graph
namespace export graph
}
package provide struct::graph 1.2.1
|