Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Graph traversal

Properties

Report a typo

Which of the following statements is true about graph traversal?

Select one or more options from the list

The sequence in which the nodes are visited is known as ordering or scheduling

There might be more than one ordering for a given graph

Completeness refers to the existance of an ordering for a given graph

Nodes can be visited more than once

___

Create a free account to access the full topic