-
Notifications
You must be signed in to change notification settings - Fork 0
/
Graph.java
43 lines (38 loc) · 1.22 KB
/
Graph.java
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
/*
* **********************************************************************
* DIEACONU CONFIDENTIAL
* _____________________
*
* Copyright 2019 Vlad-Stefan Dieaconu
* Zero Rights Reserved.
*
* NOTICE: All information contained herein is, and remains
* the property of Vlad-Stefan Dieaconu. You can use it however you want,
* it's OPEN-SOURCE, just don't say it was written by you. Give credits!
* Dissemination of this information or reproduction of this material
* is strictly approved unless prior written permission is denied by me.
* #SharingIsCaring #LongLiveOpenSource #FreeInternet
*
* Original Publisher https://github.com/vladstefandieaconu
* Date: January 2020
* **********************************************************************
*/
import java.io.*;
import java.util.*;
class Graph {
private Map<String, Vector<String>> adj = new HashMap<>();
Graph() {
}
public Map<String, Vector<String>> getGraph () {
return adj;
}
void addEdge(String from, String to) {
if(adj.containsKey(from)) {
adj.get(from).add(to);
} else {
Vector<String> aux = new Vector<>();
aux.add(to);
adj.put(from, aux);
}
}
}