GASOLINE/Graph.java at master · GMicale/GASOLINE · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
import java.util.HashMap;
import java.util.Vector;
import java.util.Iterator;

public class Graph
{
	private String name;
	private HashMap<String,Node> mapNodes;
	public Graph(String name)
	{
		this.name=name;
		mapNodes=new HashMap<String,Node>();
	}
	public boolean isEmpty()
	{
		return (numNodes()==0);
	}
	public int numNodes()
	{
		return mapNodes.size();
	}
	public int numEdges()
	{
		int numEdges=0;
		Iterator<String> it=mapNodes.keySet().iterator();
		while(it.hasNext())
		{
			String node=it.next();
			numEdges+=mapNodes.get(node).degree();
		}
		return numEdges/2;
	}
	public boolean hasEdge(String idSource, String idDest)
	{
		if(mapNodes.get(idSource).getAdiacs().containsKey(idDest))
			return true;
		else
			return false;
	}
	public String getName()
	{
		return name;
	}
	public HashMap<String,Node> getMapNodes()
	{
		return mapNodes;
	}
	public void addNode(String id)
	{
		if(!mapNodes.containsKey(id))
		{
			Node x=new Node(id);
			mapNodes.put(id,x);
		}
	}
	public void addArc(String idSource, String idDest, double weight)
	{
		Node source=mapNodes.get(idSource);
		Node dest=mapNodes.get(idDest);
		if(mapNodes.containsKey(idSource) && mapNodes.containsKey(idDest))
		{
			mapNodes.get(idSource).getAdiacs().put(idDest,weight);
			mapNodes.get(idDest).getAdiacs().put(idSource,weight);
		}
	}
	public Graph buildInducedSubgraph(Vector<String> nodes)
	{
		int i=0, j=0;
		Graph subGr=new Graph(name);
		for(i=0;i<nodes.size();i++)
			subGr.addNode(nodes.get(i));
		for(i=0;i<nodes.size();i++)
		{
			String source=nodes.get(i);
			HashMap<String,Double> adiac=mapNodes.get(source).getAdiacs();
			for(j=0;j<nodes.size();j++)
			{
				String dest=nodes.get(j);
				if(adiac.containsKey(dest))
					subGr.addArc(source,dest,adiac.get(dest));
			}
		}
		return subGr;
	}
	public String toString()
	{
		if(isEmpty())
			return "Empty graph";
		else
		{
			String nodes="Nodes = {";
			String edges="Edges = {";
			Iterator<String> itSource=mapNodes.keySet().iterator();
			while(itSource.hasNext())
			{
				String idSource=itSource.next();
				nodes+=idSource+", ";
				HashMap<String,Double> adiac=mapNodes.get(idSource).getAdiacs();
				Iterator<String> itDest=adiac.keySet().iterator();
				while(itDest.hasNext())
				{
					String idDest=itDest.next();
					if(idSource.compareTo(idDest)<0)
						edges+="("+idSource+","+idDest+","+adiac.get(idDest)+"); ";
				}
			}
			if(nodes.length()!=9)
				nodes=nodes.substring(0,nodes.length()-2);
			nodes+="}\n";
			if(edges.length()!=9)
				edges=edges.substring(0,edges.length()-2);
			edges+="}\n";
			return nodes+edges;
		}
        }
}