-
For any graph, implement any two matrix representations and a linked list representation.
Solution
a. Adjacency Matrix
b. Incedence Matrix
c. Adjacency List -
Identify any real life shortest path problem, model it using a graph and find the shortest path between an arbitrary pair of vertices.
Solution
BFS -
Implement a program to determine the connectedness and components of a graph.
Solution
Connectivity -
Identify any one application of binary tree and implement it.
Solution
Binary Search Tree -
Find the minimum spanning tree in a weighted graph.
Solution
Minimum Spanning Tree
-
Notifications
You must be signed in to change notification settings - Fork 0
aanto07/graphTheoryAssignment
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published