head	1.22;
access;
symbols
	tcllib-1-13:1.22
	tcllib-1-12:1.22
	tklib-0-5:1.10
	tcllib-1-11-1:1.10;
locks; strict;
comment	@# @;


1.22
date	2009.09.24.19.30.11;	author andreas_kupries;	state Exp;
branches;
next	1.21;

1.21
date	2009.09.24.18.03.03;	author andreas_kupries;	state Exp;
branches;
next	1.20;

1.20
date	2009.09.23.20.56.25;	author andreas_kupries;	state Exp;
branches;
next	1.19;

1.19
date	2009.09.23.18.36.21;	author andreas_kupries;	state Exp;
branches;
next	1.18;

1.18
date	2009.09.22.22.52.33;	author andreas_kupries;	state Exp;
branches;
next	1.17;

1.17
date	2009.09.22.20.30.53;	author andreas_kupries;	state Exp;
branches;
next	1.16;

1.16
date	2009.09.22.17.57.10;	author andreas_kupries;	state Exp;
branches;
next	1.15;

1.15
date	2009.09.21.23.48.03;	author andreas_kupries;	state Exp;
branches;
next	1.14;

1.14
date	2009.09.16.22.54.36;	author andreas_kupries;	state Exp;
branches;
next	1.13;

1.13
date	2009.09.16.18.51.16;	author andreas_kupries;	state Exp;
branches;
next	1.12;

1.12
date	2009.09.15.21.08.42;	author andreas_kupries;	state Exp;
branches;
next	1.11;

1.11
date	2009.09.15.03.47.25;	author andreas_kupries;	state Exp;
branches;
next	1.10;

1.10
date	2008.11.20.07.26.43;	author andreas_kupries;	state Exp;
branches;
next	1.9;

1.9
date	2008.11.19.07.39.33;	author andreas_kupries;	state Exp;
branches;
next	1.8;

1.8
date	2008.11.18.03.49.57;	author andreas_kupries;	state Exp;
branches;
next	1.7;

1.7
date	2008.11.15.05.48.27;	author andreas_kupries;	state Exp;
branches;
next	1.6;

1.6
date	2008.11.14.04.13.16;	author andreas_kupries;	state Exp;
branches;
next	1.5;

1.5
date	2008.11.13.05.36.53;	author andreas_kupries;	state Exp;
branches;
next	1.4;

1.4
date	2008.11.08.09.57.32;	author andreas_kupries;	state Exp;
branches;
next	1.3;

1.3
date	2008.11.08.06.43.18;	author andreas_kupries;	state Exp;
branches;
next	1.2;

1.2
date	2008.11.07.03.47.33;	author andreas_kupries;	state Exp;
branches;
next	1.1;

1.1
date	2008.11.05.07.28.53;	author andreas_kupries;	state Exp;
branches;
next	;


desc
@@


1.22
log
@
	* graphops.tcl (::struct::graph::op::WeightedKCenter): Fixed
	* graphops.man: object leak. Added the missing release of the
	* pkgIndex.tcl: Gi(SQ) in error case (no solution). Bumped
	* graphops.test: version to 0.11.3. Tweaked comment in testsuite
	  regarding repetition.

	* graph/tests/XOpsControl: Added testsuite for weighted k-center.
	* graph/tests/ops/weightedkcenter.test: Testsuite for weighted k-center.
	  Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Several tests demonstrates how the result is influenced by
	    node/arc ordering. Extended to accept the variations.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
	* graph/tests/ops/kcenter.test: Moved the custom matcher/verifier for
	* graph/tests/XOpsSupport: max-independent-set to shared file.
	* graph/tests/XOpsSetup: Simplified some setup procedures a bit.
@
text
@# -*- tcl -*-
# graph.testsuite:  tests for the graph operations.
#
# Copyright (c) 2008-2009 Andreas Kupries <andreas_kupries@@users.sourceforge.net>
# All rights reserved.
#
# RCS: @@(#) $Id: XOpsControl,v 1.21 2009/09/24 18:03:03 andreas_kupries Exp $

# -------------------------------------------------------------------------

set SELF [file dirname [info script]]

# -------------------------------------------------------------------------

source ${SELF}/Xsetup
source ${SELF}/Xsupport
source ${SELF}/XOpsSetup

source ${SELF}/ops/adjmatrix.test    ; # Adjacency matrix
source ${SELF}/ops/kruskal.test      ; # Minimum spanning tree/forest by Kruskal
source ${SELF}/ops/prim.test         ; # Minimum spanning tree/forest by Prim
source ${SELF}/ops/bipartite.test    ; # Compute bi-partitions.
## source ${SELF}/ops/maxmatching.test  ; # Compute maximal matching from bipartitions.
source ${SELF}/ops/tarjan.test       ; # Compute SCCs via Tarjan.
source ${SELF}/ops/components.test   ; # Compute connected components.
source ${SELF}/ops/componentof.test  ; # Compute connected components II.
source ${SELF}/ops/connected.test    ; # Graph connected ?
source ${SELF}/ops/cutvertex.test    ; # Node a cut vertex?
source ${SELF}/ops/bridge.test       ; # Arc a bridge?
source ${SELF}/ops/eulertour.test    ; # Eulerian graphs
source ${SELF}/ops/eulerpath.test    ; # Semi-eulerian graphs
source ${SELF}/ops/dijkstra.test     ; # Node distances by Dijkstra

source ${SELF}/ops/distance.test     ; # Node distances
source ${SELF}/ops/eccentricity.test ; # Node eccentricity
source ${SELF}/ops/radius.test       ; # Graph radius
source ${SELF}/ops/diameter.test     ; # Graph diameter

source ${SELF}/ops/adjlist.test      ; # Adjacency lists
source ${SELF}/ops/bellmanford.test  ; # Distances by Bellman-Ford
source ${SELF}/ops/bfs.test          ; # Breadth-First Searching.
source ${SELF}/ops/busackergowen.test; # Minimum-Cost Maximum-Flow by Busacker-Gowen
source ${SELF}/ops/christofides.test ; # mTSP by Christofides, 3/2-approximation algorithm
source ${SELF}/ops/dinicblockingflow.test ; # Blocking-Flow by Dinic
source ${SELF}/ops/dinicmaximumflow.test  ; # Maximum-Flow by Dinic
source ${SELF}/ops/edmondskarp.test  ; # Maximum-Flow by Edmonds-Karp
source ${SELF}/ops/floydwarshall.test; # Distances by Floyd-Warshall
source ${SELF}/ops/johnsons.test     ; # Distances by Johnsons
source ${SELF}/ops/kcenter.test      ; # Metric K-Center, 2-approximation algorithm
source ${SELF}/ops/maxcut.test       ; # Maximum Cut, 2-approximation algorithm
source ${SELF}/ops/mdst.test         ; # Minimum Diameter/Degree Spanning Trees
source ${SELF}/ops/metrictsp.test    ; # Metric Travelling Salesman Problem (mTSP)
#                                      # 2-approximation algorithm.
source ${SELF}/ops/mkmblockingflow.test ; # Blocking Flow by Malhotra, Kumar and Maheshwari
source ${SELF}/ops/tspheuristics.test; # Heuristics of local searching for TSP
#                                      # 2- and 3-approximation algorithms
source ${SELF}/ops/verticescover.test; # Vertex Cover, 2-approximation algorithm
source ${SELF}/ops/weightedkcenter.test   ; # Weighted Metric K-Center, 3-approximation algorithm

# -------------------------------------------------------------------------
@


1.21
log
@
	* graphops.tcl (::struct::graph::op::MaximumFlowByDinic): Fixed
	* graphops.man: object leak. Added the missing release of the
	* pkgIndex.tcl: residual graph generated in each iteration. Bumped
	  version to 0.11.2.

	* graph/tests/XOpsControl: Added testsuite for Dinic Maximum Flow.
	* graph/tests/ops/dinicmaximumflow.test: Testsuite for Dinic Maximum
	  Flow. Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Added dictsort to force a canonical ordering on the
	    results.
	  - Results updated to be in the canonical ordering.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.20 2009/09/23 20:56:25 andreas_kupries Exp $
d58 1
@


1.20
log
@
	* graphops.tcl (::struct::graph::op::MinimumDegreeSpanningTree):
	  Stop search+insertion loop after it has added the candidate
	  arc. (::struct::graph::op::MinimumDiameterSpanningTree): Fix two
	  object leaks.

	* graph/tests/XOpsControl: Added testsuite for Min D Spanning Trees.
	* graph/tests/ops/mdst.test: Testsuite for MDST.
	  Blocking Flow. Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Added undirected to force a canonical ordering on the
	    results.
	  - Results updated to be in the canonical ordering.
	  - Several tests demonstrates how the result is influenced by
	    node ordering. Extended to accept the variations.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.19 2009/09/23 18:36:21 andreas_kupries Exp $
d45 1
@


1.19
log
@
	* graphops.tcl (::struct::graph::op::BlockingFlowByMKM): Fixed
	* graphops.man: object leak. Added the missing release of the
	* pkgIndex.tcl: LevelGraph on exceptional return (No path between
	  nodes s and t). Bumped version to 0.11.1.

	* graph/tests/XOpsControl: Added testsuite for MKM Blocking Flow.
	* graph/tests/ops/mkmblockingflow.test: Testsuite for MKM
	  Blocking Flow. Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Added dictsort to force a canonical ordering on the
	    results.
	  - Results updated to be in the canonical ordering.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.18 2009/09/22 22:52:33 andreas_kupries Exp $
d50 1
@


1.18
log
@
	* graph/tests/XOpsControl: Added testsuite for Dinic Blocking Flow.
	* graph/tests/ops/dinicblockingflow.test: Testsuite for Dinic
	  Blocking Flow. Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Added dictsort to force a canonical ordering on the
	    results.
	  - Results updated to be in the canonical ordering.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.17 2009/09/22 20:30:53 andreas_kupries Exp $
d52 1
@


1.17
log
@
	* graph/tests/XOpsControl: Added testsuite for k-center.
	* graph/tests/ops/kcenter.test: Testsuite for k-center.
	  Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Several tests demonstrates how the result is influenced by
	    node ordering. Extended to accept the variations.
	  - Custom matcher/verifier for max-independent-set.
	  Note: SETUP_KCENTER_1 is not creating a complete graph,
	  violating the pre-conditions of the algorithm. This affects test
	  cases 1.3 - 1.6, it is not clear if their results are correct in
	  general.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
	* graph/tests/XOpsSetup: Re-indented, some notes added, loop
	  conditions tweaked.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.16 2009/09/22 17:57:10 andreas_kupries Exp $
d44 1
@


1.16
log
@
	* graph/tests/XOpsControl: Added testsuite for vertex cover.
	* graph/tests/ops/verticescover.test: Testsuite for vertex cover.
	  Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Several tests demonstrates how the result is influenced by
	    node ordering. Extended to accept the variations.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d4 1
a4 1
# Copyright (c) 2008 Andreas Kupries <andreas_kupries@@users.sourceforge.net>
d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.15 2009/09/21 23:48:03 andreas_kupries Exp $
d47 1
d52 1
a52 1
                                       # 2- and 3-approximation algorithms
@


1.15
log
@
	* graph/tests/XOpsControl: Added the testsuites for metrictsp,
	  christofides and tspheuristics.
	* graph/tests/ops/metrictsp.test: Testsuite for metrictsp.
	* graph/tests/ops/christofides.test: Testsuite for christofides.
	* graph/tests/ops/tspheuristics.test: Testsuite for tspheuristics.
	  Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - Conversion to v2 syntax, and cleanup of resource handling.
	  - Updated results for different implementations, sorting.

	* graph/tests/XOpsSetup (SETUP_TSPHEURISTIC_1): Fixed growing
	  cycle list throwing of repeated execution of the same test.

	* graph/tests/Xsupport: Added helper commands for the test cases
	  of the various metric tsp commands (canonical tours, ...).

	* graph/tests/Xsetup (tmSE): Added result selection based on
	  implementation of struct::set.

	* graphops.tcl (::struct::graph::op::MetricTravellingSalesman):
	  Fixed problem in algorithm for asymmetric TSP, selecting the
	  tour in the wrong (higher-weight) direction. The Fleury
	  underneath does not care about arc direction.
	  (::struct::graph::op::Christofides): Dropped superfluous
	  variable and fixed M+T operation. The matching does not care
	  about arc direction, and we have insert anti-parallel arcs to
	  avoid any existing.
	  (::struct::graph::op::isEulerian?): Extended API to return
	  tour start. Computable from the arcs, but not easy. Better to get
	  it from the algorithm which knows by definition.
	  (::struct::graph::op::findHamiltonCycle): Get tour start from
	  isEulerian, and drop bogus computation from the tour arcs.
	  (::struct::graph::op::createTGraph): Moved graph creation after
	  error check to avoid a leak when the check fails.
	* graphops.man: Bumped version to 0.11
	* pkgIndex.tcl: (isEulerian API extension, plus bugfixes).
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.14 2009/09/16 22:54:36 andreas_kupries Exp $
d43 1
a43 1
source ${SELF}/ops/christofides.test ; # mTSP by Christofides, 3/2 approximation algorithm
d49 1
a49 1
#                                      # 2 approximation algorithm.
d51 2
a52 1
                                       # 2 and 3 approximation algorithms
@


1.14
log
@
	* graph/tests/XOpsControl: Added testsuite for maxcut.
	* graph/tests/ops/maxcut.test: Testsuite for maxcut.
	  Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Indentation, line-endings
	  - test 1.4 demonstrates not only how the heuristic can run into
	    local optimum, but also how the result is influenced by node
	    ordering, critcl implementation gives optimal solution
	    instead, now accepted.
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.13 2009/09/16 18:51:16 andreas_kupries Exp $
d43 1
d48 4
@


1.13
log
@
	* graphops.tcl: Fixed indentation, and removed trailing
	  whitespace.

	* graph/tests/XOpsControl: Added testsuite for BFS.
	* graph/tests/ops/bfs.test: Testsuite for breadth-first
	  search. Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Added dictsort and lsort to force a canonical ordering on
	    results. Where sorting was not possible we provide the two
	    valid results for Tcl and Critcl implementations.
	  - Results updated to be in the canonical ordering.
	  - Indentation, line-endings
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.12 2009/09/15 21:08:42 andreas_kupries Exp $
d46 1
@


1.12
log
@
	* graph/tests/XOpsControl: Added new testsuites.
	* graph/tests/ops/busackergowen.test: Changes like for
	  edmondskarp.test, i.e. equivalent data leakage bugs (1.4-1.6).
	* graph/tests/ops/edmondskarp.test: Ditto, plus conversion of a
	  few tests to tcltest v2 form, to make the setup and cleanup of
	  resources more explicit, fixing data leakage between tests
	  (FF-1.5-1.9), and fixing test results of these. First actual bug
	  fixes.
	* graph/tests/ops/adjlist.test: Ditto, except this one is using a
	  custom sorting command.
	* graph/tests/ops/floydwarshall.test: Ditto.
	* graph/tests/ops/johnsons.test: Ditto.
	* graph/tests/ops/bellmanford.test: New testsuite for bellman-ford
	  algorithm. Changes compared to GSoC result:
	  - Test names extended with 'treeimpl'.
	  - Added dictsort to force a canonical ordering on the
	    results.
	  - Results updated to be in the canonical ordering.
	  - Indentation, line-endings
	  This passes the testsuite for both tcl and critcl
	  implementations of struct::graph.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.11 2009/09/15 03:47:25 andreas_kupries Exp $
d41 1
@


1.11
log
@
	* graphops.tcl: Destroy internal temporary object on internal
	* graphops.man: error. Bumped version to 0.9.2.
	* pkgIndex.tcl:

	* graph/tests/ops/eulerpath.test: Converted to tcltest v2 form.

	* graph/tests/XOpsControl: Added sourcing of the support code
	  needed when the graphops testsuite is run standalone.
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.10 2008/11/20 07:26:43 andreas_kupries Exp $
d39 7
@


1.10
log
@
	* graph1.test: Cleanup to avoid interference with the accelerators
	* graphops.test: of graph v2. Bring in the accelerators for queues
	* graph/tests/ops/adjmatrix.test: and stacks. Fixed bug in tarjan
	* graph/tests/ops/bipartite.test: exposed by the accelerator (*).
	* graph/tests/ops/bridge.test: (*) Changed order of arc traversal.
	* graph/tests/ops/componentof.test:
	* graph/tests/ops/components.test:
	* graph/tests/ops/connected.test:
	* graph/tests/ops/cutvertex.test:
	* graph/tests/ops/diameter.test:
	* graph/tests/ops/dijkstra.test:
	* graph/tests/ops/distance.test:
	* graph/tests/ops/eccentricity.test:
	* graph/tests/ops/eulerpath.test:
	* graph/tests/ops/eulertour.test:
	* graph/tests/ops/kruskal.test:
	* graph/tests/ops/maxmatching.test:
	* graph/tests/ops/prim.test:
	* graph/tests/ops/radius.test:
	* graph/tests/ops/tarjan.test:

	* graphops.tcl: Near-completed integration of graph algorithms.
	* graphops.man: Node distances, eccentricity, radius, diameter.
	* graph/tests/ops/distance.test: Bumped package version to 0.9.
	* graph/tests/ops/radius.test: Disabled the placeholders for max-
	* graph/tests/ops/diameter.test: matching, the only algorithm we
	* graph/tests/ops/eccentricity.test: are missing.
	* graph/tests/XOpsControl:
	* pkgIndex.tcl:
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.9 2008/11/19 07:39:33 andreas_kupries Exp $
d16 1
@


1.9
log
@
	* graphops.tcl: Continued integration of graph algorithms. Node
	* graphops.man: distances, dijkstra's algorithm. Bumped the
	* graph/tests/ops/disjkstra.test: package version to 0.8.
	* graph/tests/XOpsControl:
	* graph/tests/XOpsSetup:
	* pkgIndex.tcl:
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.8 2008/11/18 03:49:57 andreas_kupries Exp $
d18 19
a36 14
source ${SELF}/ops/adjmatrix.test   ; # Adjacency matrix
source ${SELF}/ops/kruskal.test     ; # Minimum spanning tree/forest by Kruskal
source ${SELF}/ops/prim.test        ; # Minimum spanning tree/forest by Prim
source ${SELF}/ops/bipartite.test   ; # Compute bi-partitions.
source ${SELF}/ops/maxmatching.test ; # Compute maximal matching from bipartitions.
source ${SELF}/ops/tarjan.test      ; # Compute SCCs via Tarjan.
source ${SELF}/ops/components.test  ; # Compute connected components.
source ${SELF}/ops/componentof.test ; # Compute connected components II.
source ${SELF}/ops/connected.test   ; # Graph connected ?
source ${SELF}/ops/cutvertex.test   ; # Node a cut vertex?
source ${SELF}/ops/bridge.test      ; # Arc a bridge?
source ${SELF}/ops/eulertour.test   ; # Eulerian graphs
source ${SELF}/ops/eulerpath.test   ; # Semi-eulerian graphs
source ${SELF}/ops/dijkstra.test    ; # Node distances by Dijkstra
@


1.8
log
@
	* graphops.tcl: Continued integration of graph algorithms. Euler
	* graphops.man: paths and tours. Bumped the package version
	* graph/tests/ops/eulertour.test: to 0.7.
	* graph/tests/ops/eulerpath.test:
	* graph/tests/XOpsControl:
	* graph/tests/XOpsSetup:
	* graph/tests/XOpsSupport:
	* pkgIndex.tcl:
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.7 2008/11/15 05:48:27 andreas_kupries Exp $
d31 1
@


1.7
log
@
	* graphops.tcl: Continued integration of graph algorithms. More
	* graphops.man: about connectivity. Bumped the package version
	* graph/tests/ops/connected.test: to 0.6.
	* graph/tests/ops/cutvertex.test:
	* graph/tests/ops/bridge.test:
	* graph/tests/XOpsControl:
	* pkgIndex.tcl:
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.6 2008/11/14 04:13:16 andreas_kupries Exp $
d29 2
@


1.6
log
@
	* graphops.tcl: Continued integration of graph algorithms.
	* graphops.man: Connected components. Bumped package version
	* graph/tests/ops/components.test: to 0.5.
	* graph/tests/ops/componentof.test:
	* graph/tests/XOpsControl:
	* graph/tests/XOpsSetup:
	* graph/tests/XOpsSupport:
	* pkgIndex.tcl:
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.5 2008/11/13 05:36:53 andreas_kupries Exp $
d26 3
@


1.5
log
@
	* graphops.tcl: Continued integration of graph algorithms.
	* graphops.man: SCCs via Tarjan. Placeholder for max matching.
	* graph/tests/ops/tarjan.test: Bumped version to 0.4.
	* graph/tests/ops/maxmatching.test:
	* graph/tests/XOpsControl:
	* graph/tests/XOpsSetup:
	* graph/tests/XOpsSupport:
	* pkgIndex.tcl:
@
text
@d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.4 2008/11/08 09:57:32 andreas_kupries Exp $
d24 2
@


1.4
log
@
	* graphops.tcl: Continued integration of graph algorithms.
	* graphops.man: Test for bipartite graph. Bumped version
	* graph/tests/ops/bipartite.test: to 0.3
	* graph/tests/XOpsControl:
	* graph/tests/XOpsSetup:
	* graph/tests/XOpsSupport:
	* pkgIndex.tcl:
@
text
@a3 4
# This file contains a collection of tests for one or more of the Tcl
# built-in commands.  Sourcing this file into Tcl runs the tests and
# generates output for errors.  No output means no errors were found.
#
d7 1
a7 1
# RCS: @@(#) $Id: XOpsControl,v 1.3 2008/11/08 06:43:18 andreas_kupries Exp $
d18 6
a23 4
source ${SELF}/ops/adjmatrix.test ; # Adjacency matrix
source ${SELF}/ops/kruskal.test   ; # Minimum spanning tree/forest by Kruskal
source ${SELF}/ops/prim.test      ; # Minimum spanning tree/forest by Prim
source ${SELF}/ops/bipartite.test ; # Compute bi-partitions.
@


1.3
log
@
	* graphops.tcl: Continued integration of graph algorithms.
	* graphops.man: Minimum spanning tree/forest as per Prim.
	* graph/tests/ops/prim.test: Bumped version to 0.2
	* graph/tests/XOpsControl:
	* graph/tests/XOpsSetup:
	* pkgIndex.tcl:
@
text
@d11 1
a11 1
# RCS: @@(#) $Id: XOpsControl,v 1.2 2008/11/07 03:47:33 andreas_kupries Exp $
d25 1
@


1.2
log
@
	* graphops.tcl: Continued integration of graph algorithms.
	* graphops.man: Minimum spanning tree/forest as per Kruskal.
	* graph/tests/ops/kruskal.test:
	* graph/tests/XOpsControl:
	* graph/tests/XOpsSetup:
@
text
@d11 1
a11 1
# RCS: @@(#) $Id: XOpsControl,v 1.1 2008/11/05 07:28:53 andreas_kupries Exp $
d24 1
@


1.1
log
@
	* graphops.tcl: Starting on the integration of Alejandro Paz's
	* graphops.man: (<vidriloco@@gmail.com>) work on graph operations
	* graphops.test: for GSoC 2008. First operation: Adjacency matrix.
	* pkgIndex.tcl:
	* graph/test/XOpsControl:
	* graph/test/XOpsSetup:
	* graph/test/XOpsSupport:
	* graph/test/ops/adjmatrix.test:
@
text
@d11 1
a11 1
# RCS: @@(#) $Id: Xcontrol,v 1.2 2008/10/11 23:23:48 andreas_kupries Exp $
d22 2
a23 1
source ${SELF}/ops/adjmatrix.test
@

