// Problem: Build a graph with n vertices and m edges using adjacency matrix representation. // The graph may be directed or undirected.