Allow dynamic graphs with Adjacency Matrix

[czgdp1807]

Description of the problem

With the merging of #225 Adjacency matrix will allow dynamic graphs. So, the following methods should be defined,

1. add_edge
2. remove_edge

Along with defining them, prim implementation of minimum spanning tree should work for these graphs.

Example of the problem

References/Other comments

[Aakansha99]

Kindly assign this issue to me

[czgdp1807]

We do not assign issues. You can work on it without being assigned.

[prakrutipanchal]

Hey @czgdp1807, i am interested in this topic of ALLOW DYNAMIC GRAPHS WITH ADJACENCY MATRIX, although not having much knowledge about How AI algorithm works, but having strong knowledge of DSA, can i work on this issue?