github/kubernetes
1
0
Fork 0
mirror of https://github.com/k3s-io/kubernetes.git synced 2025-10-21 22:49:31 +00:00
Code Issues Projects Releases Wiki Activity

fix typos: remove duplicated word in comments

Browse Source
This commit is contained in:
supereagle
2017-06-17 17:17:22 +08:00
parent 0f7aa6727c
commit 87c29a08e1
20 changed files with 21 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
third_party/forked/gonum/graph/traverse/traverse.go vendored
View File

@@ -21,7 +21,7 @@ type BreadthFirst struct {
}
// Walk performs a breadth-first traversal of the graph g starting from the given node,
// depending on the the EdgeFilter field and the until parameter if they are non-nil. The
// depending on the EdgeFilter field and the until parameter if they are non-nil. The
// traversal follows edges for which EdgeFilter(edge) is true and returns the first node
// for which until(node, depth) is true. During the traversal, if the Visit field is
// non-nil, it is called with the nodes joined by each followed edge.
@@ -113,7 +113,7 @@ type DepthFirst struct {
}
// Walk performs a depth-first traversal of the graph g starting from the given node,
// depending on the the EdgeFilter field and the until parameter if they are non-nil. The
// depending on the EdgeFilter field and the until parameter if they are non-nil. The
// traversal follows edges for which EdgeFilter(edge) is true and returns the first node
// for which until(node) is true. During the traversal, if the Visit field is non-nil, it
// is called with the nodes joined by each followed edge.

2
third_party/forked/gonum/graph/traverse/visit_depth_first.go vendored
View File

@@ -30,7 +30,7 @@ type VisitingDepthFirst struct {
}
// Walk performs a depth-first traversal of the graph g starting from the given node,
// depending on the the EdgeFilter field and the until parameter if they are non-nil. The
// depending on the EdgeFilter field and the until parameter if they are non-nil. The
// traversal follows edges for which EdgeFilter(edge) is true and returns the first node
// for which until(node) is true. During the traversal, if the Visit field is non-nil, it
// is called with the nodes joined by each followed edge.