Write a function, called get adjacents, that receives a T item and an empty queue. The function will fill the queue with

[answerhappygod]

Write a function, called get adjacents, that receives a T item
and an empty queue. The function will fill the queue with all items
stored in vertices that are adjacent to the vertex containing the
item sent as a parameter. // The function belongs to a graph class
with an adjacency list implementation.
emplate <class T> void Graph<T>:: getadjacents()
{
C++