Trip from S to D is coincidence by repeated random selections of vertices. Selecting adjacent vertices randomly from a graph. Probability of accomplishing trips from S to D is likely low. S is a vertex from which movements begin in a graph. D is one of vertices in a graph than a destination.
Wandering selects an adjacent vertex at a time, and the selection continues.
Wandering and duplication may share similar behavior in movements while cruise has the unique behavior that movements take the best path. Delivery, nonself-movement, can achieve movement of a virus from S to D by delivery of storage media including ROM and hard disks. A virus with wandering property released from node S begins to move from the node to a randomly selected adjacent node A , or B . Since the virus arrived at A or B , the virus also would show same movements that it moves to any other adjacent nodes. The movements will be continued unless all the resources run out thus no more space to move or all viruses are detected and eliminated.