Graph Part #1

Write a program to create a graph from an initial 2 dimensional array that stores the weights between each node. You could begin with the following Adjacency Matrix as a sample if you wish.

Your Graph should store the data in the form of Nodes and Edges, but carefully consider your implementation – a graph class / a node class / an edge class / a list of nodes / a list of edges. You will want a constructor which takes a 2 dimensional array.

Once you have created your graph class, add member functions to check the following graph properties to answer the following;
* is it a multigraph?
* is it a pseudograph?
* is it a digraph?
* is it a weighted graph?
* is it a complete graph?
* is it a disjointed graph? (with isolated nodes).