From 1e9f5fb175664dfec20d61f211e42c93b0639f74 Mon Sep 17 00:00:00 2001
From: Ir1d <sirius.caffrey@gmail.com>
Date: Wed, 16 Jan 2019 15:07:52 +0800
Subject: [PATCH] =?utf8?q?feat:=20=E5=9B=BE=E9=81=8D=E5=8E=86=E7=9A=84?=
 =?utf8?q?=E6=97=B6=E9=97=B4=E5=A4=8D=E6=9D=82=E5=BA=A6?=
MIME-Version: 1.0
Content-Type: text/plain; charset=utf8
Content-Transfer-Encoding: 8bit

---
 docs/graph/traverse.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/docs/graph/traverse.md b/docs/graph/traverse.md
index 5f1fcd16..141dd185 100644
--- a/docs/graph/traverse.md
+++ b/docs/graph/traverse.md
@@ -2,6 +2,8 @@
 
 前置知识：[DFS 基础](/search/dfs)
 
+遍历的复杂度是 $O(n + m)$
+
 ### 树上 DFS
 
 在树上 DFS 是这样的一个过程：先访问根节点，然后分别访问根节点每个儿子的子树。
-- 
2.11.0