How to do graph traversal using Breadth-first search (BFS) algo

[e.anta...@gmail.com]

Hi. I am working on small project wich used graph algo. I decided to use Grph. I have small underected graph. and I need to visit all vertexes using Breadth-first search (BFS) algo.
Can you help me and explain which method can do it.

And how i can get properties of vertex: (String) to send it to may own metod.
Thanks a lot.