/////  dfswfs 実行例 （ 頂点数 8, 辺の割合 20％ の場合 ）  /////

Graph :
 0 1 0 0 0 0 0 0
 1 0 0 0 1 1 1 0
 0 0 0 0 1 0 0 0
 0 0 0 0 0 0 0 0
 0 1 1 0 0 1 0 0
 0 1 0 0 1 0 0 1
 0 1 0 0 0 0 0 0
 0 0 0 0 0 1 0 0

Depth First Search Tree ( Root = 0 ) :
 0 1 0 0 0 0 0 0
 1 0 0 0 1 0 1 0
 0 0 0 0 1 0 0 0
 0 0 0 0 0 0 0 0
 0 1 1 0 0 1 0 0
 0 0 0 0 1 0 0 1
 0 1 0 0 0 0 0 0
 0 0 0 0 0 1 0 0

Solution : 0 -> 1 -> 4 -> 5 -> 7

Width First Search Tree ( Root = 0 ) :
 0 1 0 0 0 0 0 0
 1 0 0 0 1 1 1 0
 0 0 0 0 1 0 0 0
 0 0 0 0 0 0 0 0
 0 1 1 0 0 0 0 0
 0 1 0 0 0 0 0 1
 0 1 0 0 0 0 0 0
 0 0 0 0 0 1 0 0

Solution : 0 -> 1 -> 5 -> 7