Skip to content

A project I was given in my 3rd semester at university which processes a graph and does various operations on it.

License

Notifications You must be signed in to change notification settings

MUHAMMAD-AHMED-CS/Graph-Processing

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

⭕️ Graph-Processing ⭕️

This is a GUI based project which was given for the course of Data Structures and Algorithms in my 3rd semester.

🔴 About the Project:

🔹 Reads data from a .txt file named PPI-1 and processes it into a graphical form.

🔹 Uses SDL2 to display the graph in a circular form with nodes and edges.

🔴 Operations it can do:

🔹 Display the adjacency list of the graph.

🔹 Display the graph.

🔹 Find and display the Minimum spanning tree (Prims Algoritm).

🔹 Find and display the shortest path from a source node to a target node (Dijkstra's Algorithm).

🔹 Count the total number of nodes.

🔹 Display the node with the minimum and maximum edges.

Project Screenshot

About

A project I was given in my 3rd semester at university which processes a graph and does various operations on it.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages