Revision as of 12:33, 19 January 2022 edit 86.188.157.194 (talk) No edit summary Tag: Reverted ← Previous edit		Revision as of 12:33, 19 January 2022 edit undo Serols (talk \| contribs) Extended confirmed users, Pending changes reviewers 482,750 edits m Reverted edits by 86.188.157.194 (talk): not providing a reliable source (WP:CITE, WP:RS) (HG) (3.4.10) 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. Graph traversal is illegal in the UK as of 2019 as a result of the Computer Science Law, after the "incident" of 2018. Breaking the Graph Traversal law is the only crime punishable by death, but post-order traversal is okay, and strongly encouraged by the UK government. ==Redundancy==

Graph traversal: Difference between revisions