https://github.com/kadle11/visualization_and_operations_on_graphs

A project that uses OpenGL to Visualize Graphs and Perform Operations on them using a GUI.
https://github.com/kadle11/visualization_and_operations_on_graphs

cpp opengl

Last synced: about 2 months ago
JSON representation

A project that uses OpenGL to Visualize Graphs and Perform Operations on them using a GUI.

• Host: GitHub
• URL: https://github.com/kadle11/visualization_and_operations_on_graphs
• Owner: Kadle11
• License: gpl-3.0
• Created: 2019-07-23T19:05:52.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2022-11-14T18:34:28.000Z (over 3 years ago)
• Last Synced: 2025-02-12T14:50:49.826Z (over 1 year ago)
• Topics: cpp, opengl
• Language: C++
• Size: 79.1 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Visualization And Operations On Graphs

A project that uses OpenGL to Visualize Graphs and Perform Operations on them using a GUI.

### Prerequisites

OpenGL Library Installation on Ubuntu 16.04,

```apt-get install freeglut3-dev```

### Example

A Directed Graph is represented in the required format in "DirectedGraph.txt" and an Undirected Graph is represented in the required format in "UndirectedGraph.txt". Each node on the graph will have a different colour for better Visualization. 

* To Compile, Run make.

* To Execute, ```./Prg.out < DirectedGraph.txt```

![Image 1](https://github.com/Kadle11/Visualization_And_Operations_On_Graphs/blob/master/ScreenShots/BasicGraph.png)

![Image 2](https://github.com/Kadle11/Visualization_And_Operations_On_Graphs/blob/master/ScreenShots/Legend.png)

### Instructions

* To help with Visualization, The user can select any node and move it to any point on the canvas.

* The Legend Gives you information about all the functions provided

The Functionalities Provided are,

* Node Insertion

* Node Deletion

* Edge Insertion

* Edge Deletion

* Djikstra's Algorithm to find Shortest Path between any two selected Nodes

* Chromatic Number of the Graph

To Insert Node, Click on the Insert Node Button. 


To Delete Node, Click on the Delete Node Button and Select Node to Delete.


To Insert Edge, Click on the Insert Edge Button and Select the 2 Nodes.


To Delete Edge, Click on the Delete Edge Button and Select Edge.