Merge pull request #56 from Debashis08/release

Release

Author: Debashis08

.github/ISSUE_TEMPLATE/bug_report.md

@@ -1,38 +1,28 @@
----
-name: Bug report
-about: Create a report to help us improve
-title: ''
-labels: ''
-assignees: ''
+## Bug Report
 
----
+### Describe the Bug
+_A clear and concise description of what the bug is._
 
-**Describe the bug**
-A clear and concise description of what the bug is.
+### Steps to Reproduce
+_Steps to reproduce the behavior:_
+1. Go to `path/to/file.cpp`
+2. Run the test case: `./test_case_name`
+3. Observe the error
 
-**To Reproduce**
-Steps to reproduce the behavior:
-1. Go to '...'
-2. Click on '....'
-3. Scroll down to '....'
-4. See error
+### Expected Behavior
+_A clear and concise description of what you expected to happen._
 
-**Expected behavior**
-A clear and concise description of what you expected to happen.
+### Screenshots/Outputs
+_If applicable, add screenshots or log output to help explain the issue._
 
-**Screenshots**
-If applicable, add screenshots to help explain your problem.
+### Environment (please complete the following information):
+- **OS:** [e.g., Windows, macOS, Linux]
+- **Compiler:** [e.g., GCC 11, Clang 14, MSVC]
+- **CMake Version:** [if applicable]
+- **Any other relevant setup details**
 
-**Desktop (please complete the following information):**
- - OS: [e.g. iOS]
- - Browser [e.g. chrome, safari]
- - Version [e.g. 22]
+### Possible Fix (Optional)
+_If you have an idea of how to fix it, mention it here._
 
-**Smartphone (please complete the following information):**
- - Device: [e.g. iPhone6]
- - OS: [e.g. iOS8.1]
- - Browser [e.g. stock browser, safari]
- - Version [e.g. 22]
-
-**Additional context**
-Add any other context about the problem here.
+### Additional Context
+_Add any other context about the problem here._

.github/PULL_REQUEST_TEMPLATE.md

@@ -1,10 +1,8 @@
-# Pull Request Template
+### Description
 
-## Description
 
 
-
-## Type of Change
+### Type of Change
 
 - [ ] Bug fix
 - [ ] New feature
@@ -13,5 +11,5 @@
 - [ ] Documentation update
 
 
-## Additional Notes
+### Additional Notes
 

CODE_OF_CONDUCT.md

@@ -1,6 +1,6 @@
-# Contributor Covenant Code of Conduct
+## Contributor Covenant Code of Conduct
 
-## Our Pledge
+### Our Pledge
 
 We as members, contributors, and leaders pledge to make participation in our
 community a harassment-free experience for everyone, regardless of age, body
@@ -12,7 +12,7 @@ and orientation.
 We pledge to act and interact in ways that contribute to an open, welcoming,
 diverse, inclusive, and healthy community.
 
-## Our Standards
+### Our Standards
 
 Examples of behavior that contributes to a positive environment for our
 community include:
@@ -36,7 +36,7 @@ Examples of unacceptable behavior include:
 * Other conduct which could reasonably be considered inappropriate in a
   professional setting
 
-## Enforcement Responsibilities
+### Enforcement Responsibilities
 
 Community leaders are responsible for clarifying and enforcing our standards of
 acceptable behavior and will take appropriate and fair corrective action in
@@ -48,30 +48,29 @@ comments, commits, code, wiki edits, issues, and other contributions that are
 not aligned to this Code of Conduct, and will communicate reasons for moderation
 decisions when appropriate.
 
-## Scope
+### Scope
 
 This Code of Conduct applies within all community spaces, and also applies when
 an individual is officially representing the community in public spaces.
 Examples of representing our community include using an official e-mail address,
 posting via an official social media account, or acting as an appointed
 representative at an online or offline event.
 
-## Enforcement
+### Enforcement
 
 Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported to the community leaders responsible for enforcement at
-.
+reported to the community leaders responsible for enforcement at.
 All complaints will be reviewed and investigated promptly and fairly.
 
 All community leaders are obligated to respect the privacy and security of the
 reporter of any incident.
 
-## Enforcement Guidelines
+### Enforcement Guidelines
 
 Community leaders will follow these Community Impact Guidelines in determining
 the consequences for any action they deem in violation of this Code of Conduct:
 
-### 1. Correction
+#### 1. Correction
 
 **Community Impact**: Use of inappropriate language or other behavior deemed
 unprofessional or unwelcome in the community.
@@ -80,7 +79,7 @@ unprofessional or unwelcome in the community.
 clarity around the nature of the violation and an explanation of why the
 behavior was inappropriate. A public apology may be requested.
 
-### 2. Warning
+#### 2. Warning
 
 **Community Impact**: A violation through a single incident or series
 of actions.
@@ -92,7 +91,7 @@ includes avoiding interactions in community spaces as well as external channels
 like social media. Violating these terms may lead to a temporary or
 permanent ban.
 
-### 3. Temporary Ban
+#### 3. Temporary Ban
 
 **Community Impact**: A serious violation of community standards, including
 sustained inappropriate behavior.
@@ -103,7 +102,7 @@ private interaction with the people involved, including unsolicited interaction
 with those enforcing the Code of Conduct, is allowed during this period.
 Violating these terms may lead to a permanent ban.
 
-### 4. Permanent Ban
+#### 4. Permanent Ban
 
 **Community Impact**: Demonstrating a pattern of violation of community
 standards, including sustained inappropriate behavior,  harassment of an
@@ -112,7 +111,7 @@ individual, or aggression toward or disparagement of classes of individuals.
 **Consequence**: A permanent ban from any sort of public interaction within
 the community.
 
-## Attribution
+### Attribution
 
 This Code of Conduct is adapted from the [Contributor Covenant][homepage],
 version 2.0, available at

CONTRIBUTING.md

@@ -1 +1 @@
-### This project is for academic purpose, no contributions are expected right now.
+## This project is for academic purpose, no contributions are expected right now.

Headers/0003_Graph/0003_TopologicalSort.h

@@ -17,6 +17,7 @@ namespace TopologicalSort
         int color;
         int discoveryTime;
         int finishingTime;
+        int inDegree;
         Node* parent;
         Node(int value);
     };
@@ -35,6 +36,7 @@ namespace TopologicalSort
         void PushDirectedEdge(int valueU, int valueV);
         void PushSingleNode(int valueU);
         void TopologicalSort();
+        void KahnTopologicalSort();
         vector<pair<int, pair<int, int>>> ShowTopologicalSortResult();
     };
 }

Headers/0003_Graph/0013_AllPairsShortestPathsFloydWarshall.h

@@ -0,0 +1,24 @@
+#pragma once
+
+#include<vector>
+using namespace std;
+
+namespace AllPairsShortestPathsFloydWarshall
+{
+	class Graph
+	{
+	private:
+		int  _noOfVertices;
+		vector<vector<int>> _adjMatrix;
+		vector<vector<int>> _shortestPathMatrixFloydWarshall;
+		vector<vector<int>> _predecessorMatrix;
+		void InitializeDistanceAndPredecessors();
+		void GetShortestPath(int source, int destination, vector<int>& path);
+		
+	public:
+		void CreateGraph(int noOfVertices);
+		void PushDirectedEdge(int valueU, int valueV, int weight);
+		void FindAllPairsShortestPathsFloydWarshallSolution();
+		vector<vector<int>> GetFloydWarshallShortestPath();
+	};
+}

Headers/0003_Graph/0014_AllPairsShortestPathsJohnson.h

@@ -0,0 +1,66 @@
+#pragma once
+
+#include<map>
+#include<vector>
+#include<set>
+using namespace std;
+
+namespace AllPairsShortestPathsJohnson
+{
+	class Node
+	{
+	public:
+		int data;
+		int distance;
+		Node* parent;
+		int potentialWeight;
+		Node(int data);
+	};
+
+	class Edge
+	{
+	public:
+		Node* nodeU;
+		Node* nodeV;
+		int weight;
+		Edge(Node* nodeU, Node* nodeV, int weight);
+	};
+
+	class CompareNodeDistance
+	{
+	public:
+		bool operator()(const Node* nodeU, const Node* nodeV) const
+		{
+			return nodeU->distance < nodeV->distance;
+		}
+	};
+
+	class Graph
+	{
+	private:
+		int _noOfVertices=0;
+		map<Node*, vector<Node*>> _adjlist;
+		map<int, Node*> _nodeMap;
+		vector<Edge*> _edgeList;
+		map<Node*, vector<Edge*>> _edgeMap;
+		map<Node*, vector<Node*>> _augmentedAdjlist;
+		vector<Edge*> _augmentedEdgeList;
+		multiset<Node*, CompareNodeDistance> _operationalSet;
+		vector<vector<int>> _shortestPathMatrix;
+		vector<vector<int>> _predecessorMatrix;
+		Node* MakeOrFindNode(int data);
+		void PushAugmentedDirectedEdges(Node* sourceNode, Node* nodeV, int weight);
+		void InitializeSingleSource(Node* sourceNode);
+		void RelaxBellmanFord(Edge* edge);
+		bool BellmanFord(Node* source);
+		void RelaxDijkstra(Edge* edge);
+		void Dijkstra(Node* source);
+		void GetShortestPath(int source, int destination, vector<int>& path);
+
+	public:
+		void PushDirectedEdge(int dataU, int dataV, int weight);
+		bool FindAllPairsShortestPathsJohnsonAlgorithm();
+		vector<vector<int>> GetAllPairsShortestPathsDistanceMatrix();
+		vector<vector<int>> GetAllPairsShortestPathsPathMatrix();
+	};
+}

SECURITY.md

@@ -1 +1 @@
-# Security Policy
+## Security Policy

SourceCodes/0003_Graph/0003_TopologicalSort.cc

@@ -1,5 +1,6 @@
 #include "../Headers/0003_Graph/0003_TopologicalSort.h"
 #include<vector>
+#include<queue>
 #include<utility>
 #include<climits>
 #include<stdexcept>
@@ -10,9 +11,10 @@ namespace TopologicalSort
 	Node::Node(int value)
 	{
 		this->data = value;
+		this->color = WHITE;
 		this->discoveryTime = INT_MAX;
 		this->finishingTime = INT_MAX;
-		this->color = WHITE;
+		this->inDegree = 0;
 		this->parent = nullptr;
 	}
 
@@ -61,6 +63,7 @@ namespace TopologicalSort
 		Node* nodeV = this->MakeOrFindNode(valueV);
 
 		this->_adjlist[nodeU].push_back(nodeV);
+		nodeV->inDegree++;
 	}
 
 	void Graph::PushSingleNode(int valueU)
@@ -84,6 +87,53 @@ namespace TopologicalSort
 		}
 	}
 
+	void Graph::KahnTopologicalSort()
+	{
+		// Step-1 Compute in-degree of each vertices
+		// This is already done while creating the graph
+		this->time = 0;
+		queue<Node*> nodeQueue;
+
+		// Step-2 Enqueue vertices with in-degree 0
+		for (auto& node : this->_nodeMap)
+		{
+			if (node.second->inDegree == 0)
+			{
+				this->time++;
+				node.second->discoveryTime = time;
+				nodeQueue.push(node.second);
+			}
+		}
+
+		// Step-3 Process vertices in queue
+		while (!nodeQueue.empty())
+		{
+			Node* node = nodeQueue.front();
+			nodeQueue.pop();
+			this->time++;
+			node->finishingTime = time;
+			this->_topologicalSortedNodeList.push_back(node);
+			
+		// Step-4 Process all the neighbours of current node based on in-degree
+			for (auto& neighbour : this->_adjlist[node])
+			{
+				neighbour->inDegree--;
+				if (neighbour->inDegree == 0)
+				{
+					this->time++;
+					neighbour->discoveryTime = time;
+					nodeQueue.push(neighbour);
+				}
+			}
+		}
+
+		// Step-5 Check if a cycle exists
+		if (this->_topologicalSortedNodeList.size() != this->_nodeMap.size())
+		{
+			this->hasCycle = true;
+		}
+	}
+
 	vector<pair<int, pair<int, int>>> Graph::ShowTopologicalSortResult()
 	{
 		if (this->hasCycle == true)