Test Connectedness

Note: known to work properly in Chromium browser only.

Sedgewick Input:

Number of vertices:
Number of edges:

Test connectedness:

Iterative Depth-First Search
Recursive Breadth-First Search

Result: ?

Note: Recusive algorithms have some limitations. They work with the tiny and medium examples from References, but the stack is not large enough for the large sample. (check the Console if there is no result)

Data Description

  1. Number of Vertices (integer)
  2. Number of Edges (integer)
  3. from<space>to(integers)
  4. ...

Example

10
9
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
0 9

References