diff --git a/R/lab_3_submission.R b/R/lab_3_submission.R
index b2803fcdf28c035822c7a40c869a7d8c5f8fd04e..a22ac2530062dfc283c34d1f97899df839a085ff 100644
--- a/R/lab_3_submission.R
+++ b/R/lab_3_submission.R
@@ -57,6 +57,8 @@ init_node_distance_list <- function (init_node, graph) {
 #' @param init_node the start node in the algorithm
 #' @param checked_nodes the nodes that having found the shortest path
 #' @param unchecked_nodes the nodes that having not found the shortest path
+#' @param detail_frame to store the shorest path , if it is the best node and the related distance
+#' @param graph the graph indicates the relationship of different nodes
 
 update_detail_path <- function(node,init_node,detail_frame,graph,checked_nodes,unchecked_nodes) {
   #get connected nodes to node