On the Use of Graphs for Node Connectivity in Wireless Sensor Networks for Hostile Environments

Algorithm 1

Check connectedness of a graph.

 Input : A graph G(V,E)

 Output: True if G is connected, False otherwise

1 begin

2   found ⟵ number of nodes found by BFS

    algorithm ran over G.

3   if found == then

4     return True

5   end

6   else

7     return False

8   end

9 end