public graph dfs(string awal, string tujuan) { flag.ketemu = false; node node_awal = this.nodes[searchIdxNode(awal)]; node node_tujuan = this.nodes[searchIdxNode(tujuan)]; graph travelled_node = new graph(); graph result = new graph(); travelled_node.addNode(node_awal); dfs_rek(node_awal, node_tujuan, travelled_node, result); result.AllVertex(); return(result); }