Spelling suggestions: "subject:"cographic methods.chapter programs"" "subject:"cographic methods:complete programs""
11 |
Jedit : a graph editor in JavaVemuri, Suresh P. January 1996 (has links)
There are increasing demands for graphics-oriented software packages for graph theory teaching and research. G-Net, a departmental research project headed by Dr. Jay Bagga, is an effort to create a software package that comprises of a graph database, a graph editor, 'and a collection of graph algorithms. Also, with widespread use of the World Wide Web, the graph editor should be accessible through the Web. Taking these issues into consideration Jedit (Java Graph editor) is developed. This thesis concentrates on the design and implementation of a graph editor and a graph object (Jgraph). Jgraph is developed in java to implement the graph algorithms in future. One of the unique features of this graph editor is that it can be used as stand-alone application or as an applet for the Web. In addition, it also provides a friendly user interface. / Department of Computer Science
|
12 |
An investigation of parallel algorithms developed for graph problems and their implementation on parallel computersKondo, Boubacar January 1991 (has links)
With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computation, and with respect to some sequential algorithms. / Department of Computer Science
|
13 |
The design and implementation of Graphperfect : a graph editor for G-netMu, Xiaohua January 1992 (has links)
There is an increasing demand for a computer graphics - oriented software package for graph theory teaching and research. G-Net, a department research project headed by Dr. Kunwarjit Bagga, is an effort to create a computer software that contains a graph theory database, a graph editor, and a collection of algorithms to be executed on the graphs. This thesis concentrates on the design and implementation of a graph editor - GrapliPerfect. Graphs have been widely used to model many other phenomena. In this thesis, computer generated graphics images are used to represent graphs. This modeling relation between graphs and graphics is analyzed, and its role in the design and implementation of GraphPerfect is discussed in the thesis. To enhance the friendliness of the user interface, a simplified window system is presented. / Department of Computer Science
|
14 |
Programming the INTEL 8086 microprocessor for GRADS : a graphic real-time animation display systemHaag, Roger. January 1985 (has links)
No description available.
|
15 |
Programming the INTEL 8086 microprocessor for GRADS : a graphic real-time animation display systemHaag, Roger. January 1985 (has links)
No description available.
|
16 |
A motif-like object-oriented interface framework using PHIGSWoyak, Scott A. 05 September 2009 (has links)
Graphical user interfaces (GUIs) are defining what the interface to a program should look like. Unfortunately for programmers who need to use three-dimensional graphics found in environments like PHIGS, there is no convenient way the to use the features found in existing GUI's. This thesis describes the implementation of an interface framework running totally under PHIGS. The framework is designed using object-oriented principles and is coded in C++. The tools provided by the interface emulate the look and feel of the objects found in Motif. The interface is designed in such a way that new objects (such as windows and menu items) can be added in the future without modification to existing code. This flexibility allows programmers to specialize interfaces for their programs while maintaining complete compatibility with the base code. This also allows the framework to emulate other GUIs (such as OS/2 or Macintosh) in addition to Motif. The interface software is therefore referred to as an interface framework rather than a tool kit. The windows and menu items provided in this implementation are samples of the objects that can be created with the framework. / Master of Science
|
17 |
A hypertext graph theory reference systemIslam, Mustafa R. January 1993 (has links)
G-Net system is being developed by the members of the G-Net research group under the supervision of Dr. K. Jay Bagga. The principle objective of the G-Net system is to provide an integrated tool for dealing with various aspects of graph theory. G-Net system is divided into two parts. GETS (Graph theory Experiments Tool Set) will provide a set of tools to experiment with graph theory, and HYGRES (HYpertext Graph theory Reference Service), the second subcomponent of the G-Net system to aid graph theory study and research. In this research a hypertext application is built to present the graph theory concepts, graph models and the algorithms. In other words, HYGRES (Guide Version) provides the hypertext facilities for organizing a graph theory database in a very natural and interactive way. An hypertext application development tool, called Guide, is used to implement this version of HYGRES. This project integrates the existing version of GETS so that it can also provide important services to HYGRES. The motivation behind this project is to study the initial criterion for developing a hypertext system, which can be used for future development of a stand alone version of the G-Net system. / Department of Computer Science
|
18 |
A hypertext application and system for G-net and the complementary relationship between graph theory and hypertextSawant, Vivek Manohar January 1993 (has links)
Many areas of computer science use graph theory and thus benefit from research in graph theory. Some of the important activities involved in graph theory work are the study of concepts, algorithm development, and theorem proving. These can be facilitated by providing computerized tools for graph drawing, algorithm animation and accessing graph theory information bases. Project G-Net is aimed at developing a set of such tools.Project G-Net has chosen to provide the tools in hypertext form based on the analysis of users' requirements. The project is presently developing a hypertext application and a hypertext system for providing the above set of tools. In the process of this development various issues pertaining to hypertext authoring, hypertext usability and application of graph theory to hypertext are being explored.The focus of this thesis is in proving that hypertext approach is most appropriate for realizing the goals of the G-Net project. The author was involved in the research that went into analysis of requirements, design of hypertext application and system, and the investigation of the complementary relationship between graph theory and hypertext. / Department of Computer Science
|
19 |
Implementation of graph manipulation under X Window system environmentHsieh, Chao-Ho January 1992 (has links)
In graph theory graphs are mathematical objects that can be used to model networks, data structures, process scheduling, computations and a variety of other systems where the relations between the objects in the system play a dominant role.We will now consider graphs as mathematically self-contained units with rich structure and comprehensive theory; as models for many phenomena, particularly those arising in computer systems; and as structures which can be processed by a variety of sophisticated and interesting algorithms.For graph theory presentation, we need a very good graphical user interface(GUI) to approach the goal. X Window system is ideally suited for such a purpose. This package program is based on X Window system environment. With this package, we can manipulate graphs by special functions which can put nodes, put edges, delete nodes, delete edges, change the whole graph size, move graph location, and modify edge weights. / Department of Computer Science
|
Page generated in 0.0986 seconds