Scribd
Upload
5 views30 pages

GTCS Jess

Uploaded by

RAMANDEEP KAUR
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views30 pages

GTCS Jess

Uploaded by

RAMANDEEP KAUR
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 30

JASNOOR KAUR CSE-1 01013202721

Guru Tegh Bahadur Institute of Technology, Delhi


(AffiliatedtoGuruGobindSingh IndraprasthaUniversity, Dwarka,NewDelhi)

Department of Computer Science & Engineering

PRACTICAL FILE

Graph Theory For Computer Science

(Paper code: CIE-338P)

SUBMITTED TO : SUBMITTED BY :
Ms. SHIPRA GUGLANI JASNOOR KAUR
CSE 1
01013202721
BATCH : 2021-2025
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT- 2

Find Union, Intersection and ring-sum of 2 graphs.

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT- 1

Find the number of vertices, even vertices, odd vertices and number of edges in a Graph.

CODE
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -3

Program to Find Minimum Spanning tree Using Prim's Algorithm.

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -4

Program to Find Minimum Spanning tree Using Kruskal's Algorithm

CODE

.
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -5

Program to find Shortest Path between 2 Vertices using Dijkstra Algorithm

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -7

Program to find Shortest Path between 2 Vertices using Bellman Ford's Algorithm

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -6

Program to find
Shortest Path between
every pair of vertices
in a graph using
Floyd-Warshall's
Algorithm.

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -8

Program For finding maximum Matching for bipartite graph

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -9

Program For finding maximum Matching for General Path Program For finding maximum
Matching for bipartite graph

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT
JASNOOR KAUR CSE-1 01013202721

EXPERIMENT -10

Program to find
maximum flow from
source node to sink
node using Ford-
Fulkerson Algorithm

CODE
JASNOOR KAUR CSE-1 01013202721
JASNOOR KAUR CSE-1 01013202721

OUT PUT

You might also like