diff --git a/Dynamic Programming/Bellman-Ford.cpp b/Dynamic Programming/Bellman-Ford.cpp
index 83d2aead0..ca1cd49ef 100644
--- a/Dynamic Programming/Bellman-Ford.cpp	
+++ b/Dynamic Programming/Bellman-Ford.cpp	
@@ -39,8 +39,12 @@ class Graph{
 //Utility function to print distances
 void print(int dist[], int V){
 	cout<<"\nVertex  Distance"<<endl;
-	for(int i = 0; i < V; i++)
-		cout<<i<<"\t"<<dist[i]<<endl;
+	for(int i = 0; i < V; i++){
+		if( dist[i] != INT_MAX)
+			cout<<i<<"\t"<<dist[i]<<endl;
+		else
+			cout<<i<<"\tINF"<<endl;
+	}
 }
 
 //The main function that finds the shortest path from given source
diff --git a/Greedy Algorithms/Dijkstra.cpp b/Greedy Algorithms/Dijkstra.cpp
index 9cdcf077a..e53f227c0 100644
--- a/Greedy Algorithms/Dijkstra.cpp	
+++ b/Greedy Algorithms/Dijkstra.cpp	
@@ -40,8 +40,12 @@ int minDistance(int mdist[], bool vset[], int V){
 //Utility function to print distances
 void print(int dist[], int V){
 	cout<<"\nVertex  Distance"<<endl;
-	for(int i = 0; i < V; i++)
-		cout<<i<<"\t"<<dist[i]<<endl;
+	for(int i = 0; i < V; i++){
+		if( dist[i] != INT_MAX)
+			cout<<i<<"\t"<<dist[i]<<endl;
+		else
+			cout<<i<<"\tINF"<<endl;
+	}
 }
 
 //The main function that finds the shortest path from given source