Question: Collider.javaCollider.java With the dimensional connections mapped out via our separate chaining hash table, we can use this to create a final Adjacency List in order

Collider.javaCollider.java
With the dimensional connections mapped out via our separate chaining hash table, we can use this to create a final Adjacency List in order to more efficiently
navigate the Spider-Verse and track down anomalies.
This Java class will take three command line arguments in the following order: an dimensions list input file name, a spiderverse input file name, and an
output file name.
The dimensions input file will be formatted the same as above.
The spiderverse input file will be formatted as follows:
An integer d(the number of people in the file)
d lines, each with
The dimension this person is currently at (an integer)
The name of the person (a String)
The dimensional signature of the person (an integer)
With the clusters being completed, you and Miles need to represent these connections between each Dimension as an adjacency list showing
undirected links.
Let the first Dimension in a cluster be linked to every Dimension in its cluster and have a link going back to represent it being undirected. More
formally, in the adjacency list there must exist an edge from first d and d first for each dimension appearing in a cluster starting at first.
So edges exist from d1d2 and d2d1,d1d3 and d3d1,dotsdotsdotsdots,d1dn and dnd1(where dn is the last dimension in the
cluster)
Insert people from the Spiderverse input file in
With the dimensional connections mapped out via our separate chaining hash table, we can use this to create a final Adjacency List in order to more efficiently
navigate the Spider-Verse and track down anomalies.
This Java class will take three command line arguments in the following order: an dimensions list input file name, a spiderverse input file name, and an
output file name.
The dimensions input file will be formatted the same as above.
The spiderverse input file will be formatted as follows:
An integer d(the number of people in the file)
d lines, each with
The dimension this person is currently at (an integer)
The name of the person (a String)
The dimensional signature of the person (an integer)
With the clusters being completed, you and Miles need to represent these connections between each Dimension as an adjacency list showing
undirected links.
Let the first Dimension in a cluster be linked to every Dimension in its cluster and have a link going back to represent it being undirected. More
formally, in the adjacency list there must exist an edge from first d and d first for each dimension appearing in a cluster starting at first.
So edges exist from d1d2 and d2d1,d1d3 and d3d1,dotsdotsdotsdots,d1dn and dnd1(where dn is the last dimension in the
cluster)
Insert people from the Spiderverse input file into their corresponding dimensions. They belong to a dimension, they're not connected via edges.
The output file will be formatted as follows:
a lines, where each line starts with a dimension number, then lists all the dimensions linked to that dimension (space separated)
The order in which you output the lines DOES NOT MATTER for grading.
Compile command: javac-d bin src/spiderman/*.java
Run command: java -cp bin spiderman.Collider
dimension.in
spiderverse.in collider.out
Bellow is one example of a correct "collider.out" file obtained from running the Collider.java file with the command line arguments "
dimension.in"
"
spiderverse.in" and "collider. out' in that order
11131
651046
9281024
4610249465103019231
9446
41765
3521024
131221218
344440
3018299281974631
43131
1121024
1992440
1048440
9281042
19201024
1024688928145122649619291123363524163146651218
161042
2101218
558311
44019921048616108020241203448311902143191342
6516141710243112182099
1080440
918107
501012134042099902148311
1610101218
928107
4230146
21350101
12070331
264961024
616440
120440
83131
2024440
4161024
199999
6881024
138101218
20998356721141912186540450101
751263
831155439902145010144031913
4042099
12185010190214
421610138616109281031431913440810792
2112099
3361024
6161042
1616
83111090214
21490214
962838107
8352099
672099
4398311
31442
12186613122161010138102106510242099404
661218
4192099
90214831110214501014048311440
829301
8107962391423191392301
319134408311428107
13842
145121024
2219131
311024652219112070319999975126383111143146301

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!