Network Optimisation using Graph Theory | Desklib

Network Optimisation

Contents
1. Introduction..............................................................................................................................3
2. 2. Question 2.............................................................................................................................5
3. Question 3.................................................................................................................................7
4. Question 4.................................................................................................................................9
5. Question 5...............................................................................................................................10
6. Question 6...............................................................................................................................11
7. Question 7...............................................................................................................................15
8. Conclusion..............................................................................................................................16

1. Introduction
The main goal of this project Graph theory. The graph theory is used to mathematics study of the
graphs which are mathematics structure used to model pair wise relation between the graphs. A
graph in this context is made up of the using linked list data structure and using the different
types of algorithm in the used for the mathematical solutions. A graph is used to make up of
vertices, edges, nodes, or pointers which are connected by the graph. Graph theory is useful in
design integrated circuits for computer structure. The graph can be used to model many types of
relations and process in application real information system. Given the problem that can be
represented the as a graph with the set of nodes is connected by the edges. The nodes are usually
to representing the communication of the each edge.
Linked list structure
A linked list is the dynamic data structure is used to collection of nodes and edges of the each
element are a separate object of the data structure. Each elements (we will call is node) of a list is
comprising of two items the data is consider to the next node. The last node is considered to null.
The entry point into a linked list is called head of the list. The main advantage of the linked list
against an array is that it does not allow direct access to individual nodes element. If u wants to
access particular node then you have to start at the head node of the list. Linked list is used to
access to be consider the more memory allocation compare with array. A linked list is the
sequence of data structures which are connected together via links. The pointers are used to
objects that store the memory address of the value located in the list structure. A linked list is
used to connected of the node is used for the pointers. Unused linked list is used to order is not
given by the linked list.

There are connecting to linked list using in one node is linked with another node.
1. a
GRAPH
9
1. B
We are calculating to the edge listing to point in one node to another node.
Edge list:
1-2
1-12
1-5
2-6
2-16
6-0
8-0
9-11
10-0
16-13
1
9
12
2
5
60
10
19
18
8
16
13
11