| Package | Description |
|---|---|
| datastructures.graph |
| Modifier and Type | Method and Description |
|---|---|
IList<InfoPath> |
IGraph.bfs(int u)
It is a technique for traversing a tree, called Breadth first search
|
IList<InfoPath> |
IGraph.dfs(int u)
It is a technique for traversing a tree, called Depth first search
|