Data structure :

True or False :

1 - The implementation of the Breadth-First Search algorithm uses a queue. ( )

2- The adjacency matrix for a weighted graph has two entries for each edge. ( )

3-A cycle is a path that ends at the same vertex where it begins. ( )