Skip to content

Commit 99c8653

Browse files
ronijpandeyronijpandey
authored
Merge branch 'master' into master
2 parents 76b82b3 + 308597c commit 99c8653

50 files changed

Lines changed: 389061 additions & 815 deletions

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

‎Assembly.java‎

Lines changed: 22 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -1,32 +1,32 @@
1-
1+
package javacodes;
22
import java.util.*;
33

44
public class Assembly {
55

66
public static void main(String args[]) {
77
Scanner in = new Scanner(System.in);
8-
Map<String, Integer> vars = new HashMap<String, Integer>();
9-
Map<String, Integer> labels = new HashMap<String, Integer>();
10-
Map<Integer, Integer> endif = new HashMap<Integer, Integer>();
11-
Map<Integer, Integer> loop = new HashMap<Integer, Integer>();
8+
Map<String, Integer> vars = new HashMap<>();
9+
Map<String, Integer> labels = new HashMap<>();
10+
Map<Integer, Integer> endif = new HashMap<>();
11+
Map<Integer, Integer> loop = new HashMap<>();
1212
Stack ifs = new Stack();
1313
Stack fors = new Stack();
1414
String temp;
15-
ArrayList<String> code = new ArrayList<String>();
15+
ArrayList<String> code = new ArrayList<>();
1616
while (true) {
1717
temp = in.nextLine();
18-
if(temp.equals("###")){
18+
if (temp.equals("###")) {
1919
break;
2020
}
2121
code.add(temp);
22-
22+
2323
}
2424
//temp = in.nextLine();
2525
//code.add(temp);
2626
int l = code.size();
2727
String comp[];
2828
int a, b, i;
29-
a=b=i=0;
29+
a = b = i = 0;
3030
for (i = 0; i < l; i++) {
3131
comp = code.get(i).split(" ");
3232
switch (comp[0]) {
@@ -84,12 +84,12 @@ public static void main(String args[]) {
8484
break;
8585
case "END":
8686
endif.put((Integer) ifs.pop(), i);
87-
if(!fors.empty()){
88-
fors.pop();
87+
if (!fors.empty()) {
88+
fors.pop();
8989
}
9090
break;
9191
case "CONTINUE":
92-
loop.put(i, (Integer) fors.pop()-1);
92+
loop.put(i, (Integer) fors.pop() - 1);
9393
break;
9494
default:
9595
i = i; //do nothing
@@ -140,15 +140,17 @@ public static void main(String args[]) {
140140
break;
141141
case "IF":
142142
if (comp[1].compareTo("a") >= 0 && comp[1].compareTo("z") <= 0) {
143-
if (vars.containsKey(comp[1])) {
144-
a = vars.get(comp[1]);
145-
}} else {
143+
if (vars.containsKey(comp[1])) {
144+
a = vars.get(comp[1]);
145+
}
146+
} else {
146147
a = Integer.parseInt(comp[1]);
147148
}
148149
if (comp[2].compareTo("a") >= 0 && comp[2].compareTo("z") <= 0) {
149-
if (vars.containsKey(comp[2])) {
150-
b = vars.get(comp[2]);
151-
}} else {
150+
if (vars.containsKey(comp[2])) {
151+
b = vars.get(comp[2]);
152+
}
153+
} else {
152154

153155
b = Integer.parseInt(comp[2]);
154156
}
@@ -163,8 +165,8 @@ public static void main(String args[]) {
163165
case "LABEL":
164166
break;
165167
case "END":
166-
if(!ifs.empty()){
167-
ifs.pop();
168+
if (!ifs.empty()) {
169+
ifs.pop();
168170
}
169171
break;
170172
case "CONTINUE":

‎Dijkstra.java‎

Lines changed: 65 additions & 81 deletions
Original file line numberDiff line numberDiff line change
@@ -1,107 +1,91 @@
11
/*
22
this program is used to find minimum distance between two vertices while traversing all available vertices.
3-
*/
3+
*/
44
package javacodes;
55

66
import java.util.*;
7-
7+
88
public class Dijkstra {
9-
9+
1010
static int V;
11-
12-
int minDistance(int dist[], Boolean que[])
13-
{
14-
15-
int min = Integer.MAX_VALUE, index=-1;
16-
17-
for (int i = 0; i < V; i++)
18-
19-
if (que[i] == false && dist[i] <= min)
20-
{
11+
12+
int minDistance(int dist[], Boolean que[]) {
13+
14+
int min = Integer.MAX_VALUE, index = -1;
15+
16+
for (int i = 0; i < V; i++) {
17+
if (que[i] == false && dist[i] <= min) {
2118
min = dist[i];
22-
19+
2320
index = i;
2421
}
25-
22+
}
23+
2624
return index;
2725
}
28-
29-
30-
void printSolution(int dist[], int n)
31-
{
26+
27+
void printSolution(int dist[], int n) {
3228
System.out.println("Vertex Distance from Source");
33-
34-
for (int i = 0; i < V; i++)
35-
36-
System.out.println(i+" \t\t "+dist[i]);
29+
30+
for (int i = 0; i < V; i++) {
31+
System.out.println(i + " \t\t " + dist[i]);
32+
}
3733
}
38-
39-
40-
void dijkstra(int graph[][], int src)
41-
{
42-
int dist[] = new int[V];
43-
34+
35+
void dijkstra(int graph[][], int src) {
36+
int dist[] = new int[V];
37+
4438
Boolean que[] = new Boolean[V];
45-
46-
47-
for (int i = 0; i < V; i++)
48-
{
39+
40+
for (int i = 0; i < V; i++) {
4941
dist[i] = Integer.MAX_VALUE;
50-
42+
5143
que[i] = false;
5244
}
53-
54-
55-
dist[src] = 0; /* Starting distance is zero */
56-
57-
58-
for (int count = 0; count < V-1; count++)
59-
{
60-
45+
46+
dist[src] = 0;
47+
/* Starting distance is zero */
48+
49+
50+
for (int count = 0; count < V - 1; count++) {
51+
6152
int u = minDistance(dist, que);
62-
63-
53+
6454
que[u] = true;
65-
66-
67-
for (int i = 0; i < V; i++)
68-
69-
70-
if (!que[i] && graph[u][i]!=0 &&
71-
72-
dist[u] != Integer.MAX_VALUE &&
73-
74-
dist[u]+graph[u][i] < dist[i])
75-
76-
dist[i] = dist[u] + graph[u][i];
77-
55+
56+
for (int i = 0; i < V; i++) {
57+
if (!que[i] && graph[u][i] != 0
58+
&& dist[u] != Integer.MAX_VALUE
59+
&& dist[u] + graph[u][i] < dist[i]) {
60+
dist[i] = dist[u] + graph[u][i];
61+
}
62+
}
63+
7864
}
79-
80-
65+
8166
printSolution(dist, V);
8267
}
83-
84-
85-
public static void main (String[] args)
86-
{
87-
Scanner in=new Scanner(System.in);
88-
89-
System.out.println("Number of vertices:"); /* print the total numbers of vertices */
90-
91-
V=in.nextInt();
92-
93-
int [][]graph = new int[V][V];
94-
95-
System.out.println("Rows and Column of matrix:");
96-
97-
for(int i=0;i<V;i++)
98-
{
99-
for(int j=0;j<V;j++)
100-
101-
graph[i][j]=in.nextInt();
102-
}
103-
Dijkstra ob=new Dijkstra(); /* create new object of Dijkstra */
104-
68+
69+
public static void main(String[] args) {
70+
Scanner in = new Scanner(System.in);
71+
72+
System.out.println("Number of vertices:");
73+
/* print the total numbers of vertices */
74+
75+
V = in.nextInt();
76+
77+
int[][] graph = new int[V][V];
78+
79+
System.out.println("Rows and Column of matrix:");
80+
81+
for (int i = 0; i < V; i++) {
82+
for (int j = 0; j < V; j++) {
83+
graph[i][j] = in.nextInt();
84+
}
85+
}
86+
Dijkstra ob = new Dijkstra();
87+
/* create new object of Dijkstra */
88+
10589
ob.dijkstra(graph, 0);
10690
}
10791
}

0 commit comments

Comments
 (0)