-
Notifications
You must be signed in to change notification settings - Fork 0
/
DAG.java
131 lines (107 loc) · 2.49 KB
/
DAG.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
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
package DS;
public class DAG {
private Ljtable [] vertex;
class Ljtable {
char data;
Node head;
int inDegree;
public Ljtable(char c,int n)
{
data = c;
head = new Node(n);
inDegree = 0;
}
}
class Node {
int number;
Node next;
public Node(int a)
{
number = a;
next = null;
}
}
public DAG(char [] ch)
{
vertex = new Ljtable[ch.length];
for (int i = 0; i < ch.length; i++)
{
vertex[i] = new Ljtable(ch[i], i);
}
}
public void PrintLjtable()
{
for (Ljtable l:vertex)
{
Node p = l.head;
while (p!=null) {
System.out.print(p.number+1 + " ");
p = p.next;
}
System.out.println();
}
}
public int addArc(int a, int b)
{
a = a - 1;
b = b - 1;
if(a < 0 || a >vertex.length - 1 || b < 0 || a > vertex.length - 1 )
return -1;
else if(a == b)
return 0;
else
{
Node p = vertex[a].head;
while(p.next!=null)
{
p = p.next;
if(p.number == b)
return 0;
}
Node s = new Node(b);
p.next = s;
vertex[b].inDegree++;
return 1;
}
}
public void Topo()
{
int [] m = new int [vertex.length];
for (int i = 0; i < vertex.length; i++)
{
m[i] = vertex[i].inDegree;
}
int k = 0;
while(k < vertex.length)
for (Ljtable l:vertex)
{
if(l.inDegree == 0) {
System.out.print(l.data);
k++;
Node h = l.head;
while(h!=null) {
vertex[h.number].inDegree--;
h = h.next;
}
}
}
for (int i = 0; i < vertex.length; i++)
{
vertex[i].inDegree = m[i];
}
}
public static void main(String []args)
{
char [] ch = {'A','B','C','D','E','F','G'};
DAG dag = new DAG(ch);
dag.addArc(2,1);
dag.addArc(1,7);
dag.addArc(2,4);
dag.addArc(4,5);
dag.addArc(4,6);
dag.addArc(3,6);
dag.addArc(3,7);
dag.PrintLjtable();
dag.Topo();
}
}