[Feature Request]: Implement the adjacency matrix

[shuvojitss]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

Name:

Write a program in C++ to create adjacency matrix of a given graph. If a graph has n vertices, we use n x n matrix to represent the graph.Let's assume the n x n matrix as adj[n][n].

• if there is an edge from vertex i to j, mark adj[i][j] as 1. i.e. adj[i][j] == 1
• if there is no edge from vertex i to j, mark adj[i][j] as 0. i.e. adj[i][j] == 0

Input:

The neighbours of each node with which it is connected.

Output:

The corresponding adjacency matrix.

Record

• I agree to follow this project's Code of Conduct
• I want to work on this issue
• I'm willing to provide further clarification or assistance if needed.

Full Name

Shuvojit Samanta

Participant Role

GSSOC

[github-actions]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!