J. Berry, N. Dean, P. Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, and S. Skiena. LINK: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....shown in Figure 5 has a well defined meaning and structure. There is a host of algorithms that can be applied to a directed graph to provide feedback to the user about its properties. Many graphical tools already exist, or are in preparation, for working with generic graphs of this type, e.g. [3]. As part of the investigation of early fault detection tools, we have built a similar tool, which ties in directly with several others, as will be discussed below. The tool, called (Pictures of Graph Algorithms) consists of a generic graphical interface, written in about 1200 lines of Tcl Tk ....

J. Berry, N. Dean, P.Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, S. Sklena. Link: A Combinatorics and Graph theory workbench for applications and research. DIMACS, Technical Report 95--15, June 1995.

No context found.

J. Berry, N. Dean, P. Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, and S. Skiena. LINK: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.

....user interface consists exclusively of new STklos classes so that users may take advantage of high level, object oriented functionality to manipulate their data. STk (describe (graph (current graph view) #[ dbingraph #p63f5cc] is an instance of class dbingraph Slots are: val = f[1 2 3 4 5 6] f 1 2 1 6 2 5 3 4 5 3 5 6 gg #f STk (map color (vertices (current graph view) black black black black black black ) STk (define vg(car(vertices(current graph view) #[undefined] STk (set (color vg) green ) #[undefined] STk (map color (vertices ....

.... 3) 3 1) #[undefined] STk (define h (graph (2 3 4) 2) 2 3 4) 3 4) #[undefined] STk (define ng (graph ( vertices g) vertices h) edges g) edges h) #[undefined] STk (describe ng) #[ uhypergraph #p63e848] is an instance of class uhypergraph Slots are: val = f[1 2 3 4] ff1 2g f1 3g f2g f2 3g f2 3 4g f3 4ggg #f Figure 11: An example which uses Collection methods 4.2 Graphical User Interface STklos provides a core set of graphics classes (windows, labels, buttons, etc. which make interface customization a high level operation, and LINK s graphical interface ....

[Article contains additional citation context not shown here]

J. Berry, N. Dean, P. Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, and S. Skiena. LINK: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995. 20

....SIGCSE SIGCUE Conference on Integrating Technology in Computer Science Education which provides an extended example: using LINK to present a strongly connected components algorithm as a puzzle, then explain it in more detail as students gain intuition. The early development of LINK is detailed in [3]. There is still much more work to be done to make LINK a widely useful tool. The algorithms library still lacks numerous fundamental components, and there are no course materials designed to make use of LINK. DIMACS, Elon College, and RPI are actively seeking funding to prepare an extensive yet ....

J. Berry, N. Dean, P. Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, and S. Skiena. LINK: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.

....andwe are committed to makingLINK more accessiblein the future. The current system is described in the manual available from the web site, and the latter also contains links to a preview paper and a paper concerning LINK and market basket analysis. The early development of LINK is detailed in [2]. There is still much more work to be done to make LINK a widely useful tool. The algorithms library lacks numerous fundamental components, and there are no course materials designed to make use of LINK. DIMACS, Elon College, and RPI are actively seeking funding to improve this situation by ....

BERRY, J., DEAN, N., FASEL, P., GOLDBERG, M., JOHNSON,E., MACCUISH, J., SHANNON, G., ANDSKIENA, S. LINK: A combinatorics and graph theory workbench for applications and research. Tech. Rep. 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.

.... The default attributes for all graph objects (including vertices and edges) are currently name, direction, width, size, weight, x, y, color, label, mark, type, starttime, STk (describe (graph (current graph view) #[ dbingraph #p63f5cc] is an instance of class dbingraph Slots are: val = f[1 2 3 4 5 6] f 1 2 1 6 2 5 3 4 5 3 5 6 gg #f STk (map color (vertices (current graph view) black black black black black black ) STk (define vg(car(vertices(current graph view) #[undefined] STk (set (color vg) green ) #[undefined] STk (map color (vertices ....

.... (2 3) 3 1) #[undefined] STk (define h (graph (2 3 4) 2) 2 3 4) 3 4) #[undefined] STk (define ng (graph ( vertices g) vertices h) edges g) edges h) #[undefined] STk (describe ng) #[ uhypergraph #p63e848] is an instance of class uhypergraph Slots are: val = f[1 2 3 4] ff1 2g f1 3g f2g f2 3g f2 3 4g f3 4ggg #f Figure 7: An example which uses Collection methods extracts the weight slot from each STklos edge object in the graph window called gv. Note that mst, the variable used to store the result of the spanning tree algorithm, is a LINK set object. This is ....

[Article contains additional citation context not shown here]

J. Berry, N. Dean, P. Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, and S. Skiena. LINK: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.

....Polytechnic Institute, and The State University of New York at Stony Brook. The project was conceived by Nathaniel Dean, Mark Goldberg, Gregory Shannon, Steven Skiena, and Daniel Gorenstein, the founding director of DIMACS. Many people have contributed to the design and development of the system [3]. More information on Link is available at http: dimacs.rutgers.edu. The most distinguishing features of Link, when compared to other graph visualization software, are that it combines flexible algorithmic and visualization features with a powerful computing environment. Users can manipulate ....

J. Berry, N. Dean, P. Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, and S. Skiena. Link: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC