CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-04-24 10:32:01 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents(algo): fix typo and suggestions (#272)

Browse Source
This commit is contained in:
jomosz
2022-05-14 11:02:26 +12:00
committed by GitHub
parent d90f358311
commit 87a923079d
7 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contents/algorithms/graph.md
View File

@@ -42,7 +42,7 @@ Be familiar with the various graph representations, graph search algorithms and
## Graph representations
You can be given a list of edges and you have to build your own graph from the edges so that you can perform a traversal on. them The common graph representations are:
You can be given a list of edges and you have to build your own graph from the edges so that you can perform a traversal on them. The common graph representations are:
- Adjacency matrix
- Adjacency list