Skip to content
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
IgorKrol
ProbSolvWithSearch
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
check1
Breadcrumbs
ProbSolvWithSearch
/
Main.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
24 lines (19 loc) · 790 Bytes
check1
Breadcrumbs
ProbSolvWithSearch
/
Main.java
Copy path
Top
File metadata and controls
Code
Blame
24 lines (19 loc) · 790 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
import java.io.IOException;
import java.util.HashSet;
public class Main {
public static void main(String[] args) throws IOException {
Node node = new Node("", null, new FileParser("input6.txt").parse());
System.out.println(Algorithms.BFS(node));
System.out.println(Algorithms.DFID(node));
System.out.println(Algorithms.UCS(node));
System.out.println(Algorithms.IDA(node));
System.out.println(Algorithms.DFBnB(node));
//
// int[][] gg = {{1,2,3,4},{5,6,7,8},{9,10,11,0}};
// Node g = new Node("g", null, gg);
// int[][] bb = {{11,2,3,4},{5,6,7,8},{9,10,1,0}};
// Node b = new Node("b", null, bb);
// PriorityQueueNode p = new PriorityQueueNode();
// s.add(g);
}
}
You can’t perform that action at this time.