backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-11 19:17:21 +08:00
Code Issues Projects Releases Wiki Activity

Adjust comment.

Browse Source
This commit is contained in:
Filip Hlásek
2020-08-17 20:10:03 -07:00
parent 9927b46205
commit c1a2e33f2f
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
graph/depth_first_search.cpp
View File

@@ -54,7 +54,7 @@ namespace graph {
* *
*/ */
void addEdge(std::vector<std::vector<size_t>> *adj, size_t u, size_t v) { void addEdge(std::vector<std::vector<size_t>> *adj, size_t u, size_t v) {
/** /*
* *
* Here we are considering undirected graph that's the * Here we are considering undirected graph that's the
* reason we are adding v to the adjacency list representation of u * reason we are adding v to the adjacency list representation of u