Graph traversal: Difference between revisions

Content deleted Content added
m Reverting possible vandalism by 86.188.157.194 to version by Buddly27. Report False Positive? Thanks, ClueBot NG. (4111651) (Bot)
No edit summary
Tag: Reverted
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==