update markdown title

lhmzhou · web-flow · commit b6f3cd4c53a2 · 2022-10-14T20:49:10.000-05:00
diff --git a/graphs/topological_sort.md b/graphs/topological_sort.md
@@ -1,4 +1,4 @@
-## Introduction
+## Introduction to Topological Sorting
 Aside from DFS and BFS, the most common graph concept that interviews will test is topological sorting. Topological sorting produces a linear ordering of nodes in a directed graph such that the direction of edges is respected. 
 
 A **topological sort** is an ordering of nodes for a directed acyclic graph (DAG) such that for every directed edge _uv_ from vertex _u_ to vertex _v_, _u_ comes before _v_ in the ordering.

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-## Introduction`
	`1`	`+## Introduction to Topological Sorting`
`2`	`2`	`Aside from DFS and BFS, the most common graph concept that interviews will test is topological sorting. Topological sorting produces a linear ordering of nodes in a directed graph such that the direction of edges is respected.`
`3`	`3`
`4`	`4`	`A topological sort is an ordering of nodes for a directed acyclic graph (DAG) such that for every directed edge _uv_ from vertex _u_ to vertex _v_, _u_ comes before _v_ in the ordering.`