Revision as of 12:23, 19 January 2022 edit 86.188.157.194 (talk) No edit summary Tag: Reverted ← Previous edit		Revision as of 12:23, 19 January 2022 edit undo ClueBot NG (talk \| contribs) Bots, Pending changes reviewers, Rollbackers 6,476,541 edits m Reverting possible vandalism by 86.188.157.194 to version by Buddly27. Report False Positive? Thanks, ClueBot NG. (4111651) (Bot) Tag: Rollback Next edit →
Line 4: In [[computer science]], '''graph traversal''' (also known as '''graph search''') refers to the process of visiting (checking and/or updating) each vertex in a [[Graph (discrete mathematics)\|graph]]. Such traversals are classified by the order in which the vertices are visited. [[Tree traversal]] is a special case of graph traversal. ~~Post order traversal is a bit silly because you have to go backwards.~~ ==Redundancy==

Graph traversal: Difference between revisions