diff --git a/dynamic_programming/floyd_warshall.cpp b/dynamic_programming/floyd_warshall.cpp
index d193ebbd589..02a682f07a5 100644
--- a/dynamic_programming/floyd_warshall.cpp
+++ b/dynamic_programming/floyd_warshall.cpp
@@ -51,7 +51,7 @@ void print(int dist[], int V) {
 
 // The main function that finds the shortest path from a vertex
 // to all other vertices using Floyd-Warshall Algorithm.
-void FloydWarshall(Graph graph) {
+void FloydWarshall(Graph& graph) {
     int V = graph.vertexNum;
     int dist[V][V];