diff options
| author | mo khan <mo.khan@gmail.com> | 2020-09-27 13:17:17 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-09-27 13:17:17 -0600 |
| commit | d7a7bb79053acec1e6d50ffae89f374447974890 (patch) | |
| tree | 49073a0f2a33d94258196d6ae4936aa7ca43e78d /src | |
| parent | 44f9921f41d24336e2b1382691778d77a29813db (diff) | |
docs: Document input parameters for matrix_traverse function3.0.0
Diffstat (limited to 'src')
| -rw-r--r-- | src/03/matrix.c | 5 |
1 files changed, 5 insertions, 0 deletions
diff --git a/src/03/matrix.c b/src/03/matrix.c index 1e4d310..5cdcc45 100644 --- a/src/03/matrix.c +++ b/src/03/matrix.c @@ -9,6 +9,11 @@ char labels[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', * Traverses a graph represented as an adjacency matrix * to visit every vertex in the graph and traverse each * edge in both directions only once. + * + * @param n The # of vertexes in the graph + * @param graph An adjacency matrix that represents the graph + * @param visited An array that keeps track of which vertexes have been visited + * @param vertex The current vertex to traverse. */ void matrix_traverse(int n, int graph[n][n], int visited[n], int vertex) { printf("->(%c)", labels[vertex]); |
