mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
Adjust comment.
This commit is contained in:
parent
9927b46205
commit
c1a2e33f2f
@ -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
|
||||||
|
Loading…
Reference in New Issue
Block a user