DGraph - shirabs/Ex_2 GitHub Wiki

DGraph is calass that represents the connetions between EdgeData to DataNode. DGraph Defined like this :

• private String type="DGraph";
• private HashMap<Integer,node_data> DataMap;
• private HashMap<Integer, HashMap<Integer, edge_data>> EdgeMap;
• private int countEdge=0;
• private int mc;

---

public DGraph()

Empty Constructor.

---

• public node_data getNode(int key)

get key and return node.

• public edge_data getEdge(int src, int dest)

get start and end , return EdgeData.

public void addNode(node_data n)

method that add node.

• public void connect(int src, int dest, double w)

This method get Src and Dest that represented by the key of the desired nodes and Weight of the edge and make a new edge in the graph.

• public Collection<node_data> getV()

This method bring the nodes collection of the graph.

• public Collection<edge_data> getE(int node_id)

This method get a key of node and bring the edges collection tha connect to this node.

• public node_data removeNode(int key)

This method get a key of node and delete the node and all the edges that connected it.

• public edge_data removeEdge(int src, int dest)

This method get Src and Dest that represented by the key of the desired nodes and delete the edge from the graph.

• public int nodeSize()

Return node size.

• public int edgeSize()

Return Edge size.

• public int getMC()

Return mc (number of changes on the graph).