OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

added class destructor to clean up dynamic memory allocation

Browse Source
This commit is contained in:
Krishna Vedala 2020-05-29 23:15:28 -04:00
parent b285d09d6a
commit 231d5c4858
1 changed files with 22 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
dynamic_programming/floyd_warshall.cpp
View File

@ -1,44 +1,44 @@
#include <limits.h> #include <climits>
#include <string.h>
#include <iostream> #include <iostream>
#include <string>
using namespace std; using std::cin;
using std::cout;
using std::endl;
// Wrapper class for storing a graph // Wrapper class for storing a graph
class Graph class Graph {
{
public: public:
int vertexNum; int vertexNum;
int **edges; int **edges;
// Constructs a graph with V vertices and E edges // Constructs a graph with V vertices and E edges
Graph(int V) Graph(int V) {
{
this->vertexNum = V; this->vertexNum = V;
this->edges = (int **)malloc(V * sizeof(int *)); this->edges = new int *[V];
for (int i = 0; i < V; i++) for (int i = 0; i < V; i++) {
{ this->edges[i] = new int[V];
this->edges[i] = (int *)malloc(V * sizeof(int));
for (int j = 0; j < V; j++) this->edges[i][j] = INT_MAX; for (int j = 0; j < V; j++) this->edges[i][j] = INT_MAX;
this->edges[i][i] = 0; this->edges[i][i] = 0;
} }
} }
~Graph() {
for (int i = 0; i < vertexNum; i++) delete[] edges[i];
delete[] edges;
}
// Adds the given edge to the graph // Adds the given edge to the graph
void addEdge(int src, int dst, int weight) void addEdge(int src, int dst, int weight) {
{
this->edges[src][dst] = weight; this->edges[src][dst] = weight;
} }
}; };
// Utility function to print distances // Utility function to print distances
void print(int dist[], int V) void print(int dist[], int V) {
{
cout << "\nThe Distance matrix for Floyd - Warshall" << endl; cout << "\nThe Distance matrix for Floyd - Warshall" << endl;
for (int i = 0; i < V; i++) for (int i = 0; i < V; i++) {
{ for (int j = 0; j < V; j++) {
for (int j = 0; j < V; j++)
{
if (dist[i * V + j] != INT_MAX) if (dist[i * V + j] != INT_MAX)
cout << dist[i * V + j] << "\t"; cout << dist[i * V + j] << "\t";
else else
@ -51,8 +51,7 @@ void print(int dist[], int V)
// The main function that finds the shortest path from a vertex // The main function that finds the shortest path from a vertex
// to all other vertices using Floyd-Warshall Algorithm. // to all other vertices using Floyd-Warshall Algorithm.
void FloydWarshall(Graph graph) void FloydWarshall(Graph graph) {
{
int V = graph.vertexNum; int V = graph.vertexNum;
int dist[V][V]; int dist[V][V];
@ -85,8 +84,7 @@ void FloydWarshall(Graph graph)
} }
// Driver Function // Driver Function
int main() int main() {
{
int V, E; int V, E;
int src, dst, weight; int src, dst, weight;
cout << "Enter number of vertices: "; cout << "Enter number of vertices: ";
@ -94,8 +92,7 @@ int main()
cout << "Enter number of edges: "; cout << "Enter number of edges: ";
cin >> E; cin >> E;
Graph G(V); Graph G(V);
for (int i = 0; i < E; i++) for (int i = 0; i < E; i++) {
{
cout << "\nEdge " << i + 1 << "\nEnter source: "; cout << "\nEdge " << i + 1 << "\nEnter source: ";
cin >> src; cin >> src;
cout << "Enter destination: "; cout << "Enter destination: ";