Tasks:
#Using the graph class definition and member functions, complete the partial BFS algorithm and print out all vertices of the graph starting from different positions.
#Define a new BFS method to find a sertain vertex in a graph.
#Define a new BFS method to count how many ends are met during search.