Hospital-Management-System/Graph.java at main · Huzaifa150921/Hospital-Management-System · 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
public class Graph<T1, T2> {

    public ArrayList<Vertex<T1>> vertices;
    public ArrayList<Vertex<T2>> vertices1;

    public Graph() {
        vertices = new ArrayList<>();
        vertices1 = new ArrayList<>();
    }

    public void addVertex(T1 data) {
        Vertex<T1> newVertex = new Vertex<>(data);
        vertices.add(newVertex);
    }

    public void removeVertex(T1 data) {
        Vertex<T1> vertexToRemove = null;
        for (int i = 0; i < vertices.size(); i++) {
            if (vertices.get(i).getData().equals(data)) {
                vertexToRemove = vertices.get(i);
                break;
            }
        }
        if (vertexToRemove != null) {
            vertices.remove(vertexToRemove);
        }
    }

    public void addVertex1(T2 data) {
        Vertex<T2> newVertex = new Vertex<>(data);
        vertices1.add(newVertex);
    }

    public void removeVertex1(T2 data) {
        Vertex<T2> vertexToRemove = null;
        for (int i = 0; i < vertices1.size(); i++) {
            if (vertices1.get(i).getData().equals(data)) {
                vertexToRemove = vertices1.get(i);
                break;
            }
        }
        if (vertexToRemove != null) {
            vertices1.remove(vertexToRemove);
        }
    }

    public void addEdge(T1 source, T2 destination) {
        Vertex<T1> sourceVertex = null;
        Vertex<T1> destinationVertex = null;
        for (int i = 0; i < vertices.size(); i++) {
            Vertex<T1> vertex = vertices.get(i);
            if (vertex.getData().equals(source)) {
                sourceVertex = vertex;
            }
            if (vertex.getData().equals(destination)) {
                destinationVertex = vertex;
            }
        }
        if (sourceVertex != null && destinationVertex != null) {
            sourceVertex.addEdge(destinationVertex);
        }
    }


    public ArrayList<Vertex<T1>> getVertices() {
        return vertices;
    }


    public static class Vertex<T1> {

        private T1 data;
        public ArrayList<Vertex<T1>> incomingEdges;

        public Vertex(T1 data) {
            this.data = data;
            incomingEdges = new ArrayList<>();
        }

        public T1 getData() {
            return data;
        }

        private void addEdge(Vertex<T1> source) {
            incomingEdges.add(source);
        }


    }
}