Rapid Application

1. Graphs For Adjecency
Matrices
Practical For Visual
Computing
ICT2172

2. Overview
• Introduction
• Objectives
• Process
 Methodology
• Advantages
• Development Technologies & Supporting
Tools
• References
• Future Plans

3. Introduction
• In graph theory and computing science
adjacency matrix is a square matrix
use to represent a finite graph.The
element of the matrix indicate whether
pairs of vertices are adjacent or not in
the graph.
• In here we create a software for
getting the graph when we input the
matrix.

4. Objectives
• The graph is a graphical representation of
a matrix.
• Our main objective is
identify the connectivity
of the pairs of vertices in the matrix.

5. Process

6. Front Form

7. Choosing Form

8. Home Form

9. Advantages
• This is a desktop application. So it is easy to
access system from anywhere.
• No need to waste time for
drawing the graph.
• Quick & easy to use.
• No need to do paper works.

10. Development Technologies
& Supporting Tools
• Programming Language -C#
• Development Environment -Visual Studio

11. References
• graphonline.ru
• www.vcskicks.com
• stackoverflow.com
• mycodeschool.com

12. Future Plans
• We are planning to develop this software..,
• For weighted graphs
• Directed graphs

13. Thank You….