DanielCujba/School
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

School Commit Init

Browse Source
This commit is contained in:
Daniel Cujba
2024-08-31 12:07:21 +03:00
commit 0b130ee18c
2801 changed files with 4720552 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Anul 1/Semestrul 2/Graph Algo/Labs/Lab 3/.gitignore
+4
View File
@@ -0,0 +1,4 @@
.vscode
*.txt
*.pdf
Anul 1/Semestrul 2/Graph Algo/Labs/Lab 3/DirectedGraphJava/DirectedGraph.java
+349
View File
@@ -0,0 +1,349 @@
package DirectedGraphJava;
import java.util.HashSet;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Queue;
import java.util.Set;
import java.util.LinkedList;
import java.util.ArrayList;
import java.util.Collections;
public class DirectedGraph implements IDirectedGraph {
private HashSet<Integer> _vertices = new HashSet<Integer>();
private HashMap<Integer, HashSet<Integer>> _inbounds = new HashMap<Integer, HashSet<Integer>>();
private HashMap<Integer, HashSet<Integer>> _outbounds = new HashMap<Integer, HashSet<Integer>>();
private HashMap<Pair<Integer,Integer>,Integer> _edges = new HashMap<Pair<Integer,Integer>,Integer>();
public DirectedGraph() {
//nothing to do
}
public DirectedGraph reindex(){
HashMap<Integer,Integer> oldToNew = new HashMap<Integer,Integer>();
int i = 0;
for (Integer vertex : _vertices) {
oldToNew.put(vertex,i);
i++;
}
DirectedGraph newGraph = new DirectedGraph();
for (Integer vertex : _vertices) {
newGraph.addVertex(oldToNew.get(vertex));
}
for (Pair<Integer,Integer> edge : _edges.keySet()) {
newGraph.addEdge(oldToNew.get(edge.first),oldToNew.get(edge.second),_edges.get(edge));
}
return newGraph;
}
public Integer numVertices() {
return _vertices.size();
}
public Integer numEdges() {
return _edges.size();
}
public Iterator<Integer> vertices() {
return _vertices.iterator();
}
public Iterator<Pair<Pair<Integer,Integer>,Integer>> edges() {
HashSet<Pair<Pair<Integer,Integer>,Integer>> keyValues = new HashSet<Pair<Pair<Integer,Integer>,Integer>>();
for (Pair<Integer,Integer> key : this._edges.keySet()) {
Pair<Pair<Integer,Integer>,Integer> keyValuePair = new Pair<Pair<Integer,Integer>,Integer>(key,this._edges.get(key));
keyValues.add(keyValuePair);
}
return keyValues.iterator();
}
public boolean isEdge(Integer v1, Integer v2) {
if(!_vertices.contains(v1) || !_vertices.contains(v2)) {
throw new IllegalArgumentException("Vertex does not exist");
}
return _edges.containsKey(new Pair<Integer,Integer>(v1,v2));
}
public int inDegree(Integer v) {
if(!_vertices.contains(v)) {
throw new IllegalArgumentException("Vertex does not exist");
}
return _inbounds.get(v).size();
}
public int outDegree(Integer v) {
if(!_vertices.contains(v)) {
throw new IllegalArgumentException("Vertex does not exist");
}
return _outbounds.get(v).size();
}
public Iterator<Integer> inbounds(Integer v) {
if(!_vertices.contains(v)) {
throw new IllegalArgumentException("Vertex does not exist");
}
return _inbounds.get(v).iterator();
}
public Iterator<Integer> outbounds(Integer v) {
if(!_vertices.contains(v)) {
throw new IllegalArgumentException("Vertex does not exist");
}
return _outbounds.get(v).iterator();
}
public Integer weight(Integer v1, Integer v2) {
if(!_vertices.contains(v1) || !_vertices.contains(v2)) {
throw new IllegalArgumentException("Vertex does not exist");
}
if(!_edges.containsKey(new Pair<Integer,Integer>(v1,v2))) {
throw new IllegalArgumentException("Edge does not exist");
}
return _edges.get(new Pair<Integer,Integer>(v1,v2));
}
public void weight(Integer v1, Integer v2, Integer w) {
if(!_vertices.contains(v1) || !_vertices.contains(v2)) {
throw new IllegalArgumentException("Vertex does not exist");
}
if(!_edges.containsKey(new Pair<Integer,Integer>(v1,v2))) {
throw new IllegalArgumentException("Edge does not exist");
}
_edges.put(new Pair<Integer,Integer>(v1,v2),w);
}
public void addVertex(Integer v) {
if(_vertices.contains(v)) {
throw new IllegalArgumentException("Vertex already exists");
}
_vertices.add(v);
_inbounds.put(v,new HashSet<Integer>());
_outbounds.put(v,new HashSet<Integer>());
}
public void removeVertex(Integer v) {
if(!_vertices.contains(v)) {
throw new IllegalArgumentException("Vertex does not exist");
}
_vertices.remove(v);
for (Integer vertex : _inbounds.get(v)) {
_outbounds.get(vertex).remove(v);
_edges.remove(new Pair<Integer,Integer>(vertex,v));
}
for (Integer vertex : _outbounds.get(v)) {
_inbounds.get(vertex).remove(v);
_edges.remove(new Pair<Integer,Integer>(v,vertex));
}
_inbounds.remove(v);
_outbounds.remove(v);
}
public void addEdge(Integer v1, Integer v2, Integer w) {
if(!_vertices.contains(v1) || !_vertices.contains(v2)) {
throw new IllegalArgumentException("Vertex does not exist");
}
if(_edges.containsKey(new Pair<Integer,Integer>(v1,v2))) {
throw new IllegalArgumentException("Edge already exists");
}
_edges.put(new Pair<Integer,Integer>(v1,v2),w);
_inbounds.get(v2).add(v1);
_outbounds.get(v1).add(v2);
}
public void removeEdge(Integer v1, Integer v2) {
if(!_vertices.contains(v1) || !_vertices.contains(v2)) {
throw new IllegalArgumentException("Vertex does not exist");
}
if(!_edges.containsKey(new Pair<Integer,Integer>(v1,v2))) {
throw new IllegalArgumentException("Edge does not exist");
}
_edges.remove(new Pair<Integer,Integer>(v1,v2));
_inbounds.get(v2).remove(v1);
_outbounds.get(v1).remove(v2);
}
public HashMap<Integer,Pair<Integer,Integer>> shortestPath(Integer v){
//Initializations
Queue<Integer> queue = new LinkedList<Integer>();
HashMap<Integer,Pair<Integer,Integer>> map = new HashMap<Integer,Pair<Integer,Integer>>();
Set<Integer> visited = new HashSet<Integer>();
for(Iterator<Integer> vertex = this._vertices.iterator();vertex.hasNext();){
map.put(vertex.next(),new Pair<Integer,Integer>(null,-1));
}
//Add the first vertex to the queue, the visited set, and the map of distances and parents with a distance of 0
map.put(v,new Pair<Integer,Integer>(null,0));
queue.add(v);
map.put(v,new Pair<Integer,Integer>(null,0));
visited.add(v);
//BFS to find the shortest path
while(!queue.isEmpty()){
Integer current = queue.poll(); //Get the next vertex
//For each neighbor of the current vertex
for(Integer neighbor : _outbounds.get(current)){
//If the neighbor has not been visited, add it to the queue, the visited set, and the map of distances and parents with a distance of 1 more than the current vertex
if(!visited.contains(neighbor)){
queue.add(neighbor);
visited.add(neighbor);
map.put(neighbor,new Pair<Integer,Integer>(current,map.get(current).second+1));
}
}
}
return map;
}
public HashMap<Integer,Pair<Integer,Integer>> shortestPath(Integer v,Integer u){
//Initializations
Queue<Integer> queue = new LinkedList<Integer>();
HashMap<Integer,Pair<Integer,Integer>> map = new HashMap<Integer,Pair<Integer,Integer>>();
Set<Integer> visited = new HashSet<Integer>();
for(Iterator<Integer> vertex = this._vertices.iterator();vertex.hasNext();){
map.put(vertex.next(),new Pair<Integer,Integer>(null,-1));
}
//Add the first vertex to the queue, the visited set, and the map of distances and parents with a distance of 0
map.put(v,new Pair<Integer,Integer>(null,0));
queue.add(v);
map.put(v,new Pair<Integer,Integer>(null,0));
visited.add(v);
//BFS to find the shortest path
while(!queue.isEmpty()){
Integer current = queue.poll(); //Get the next vertex
//For each neighbor of the current vertex
for(Integer neighbor : _outbounds.get(current)){
//If the neighbor has not been visited yet add it to the queue, visited set, and map.
if(!visited.contains(neighbor)){
queue.add(neighbor);
visited.add(neighbor);
//Add the neighbor to the map with the current vertex as its parent and a distance of the current vertex's distance + 1
map.put(neighbor,new Pair<Integer,Integer>(current,map.get(current).second+1));
//If the neighbor is the destination vertex return the map
if(neighbor == u)
return map;
}
}
}
return map;
}
public ArrayList<Integer> path(Integer v1,Integer v2){
//Get the shortest path from v1 to v2
HashMap<Integer,Pair<Integer,Integer>> map = shortestPath(v1);
ArrayList<Integer> path = new ArrayList<Integer>();
//If there is no path return an empty arraylist
if(map.get(v2).second == -1)
return path;
path.add(v2);
//Add each vertex in the path to the arraylist starting from the destination vertex
while(map.containsKey(v2)){
path.add(map.get(v2).first);
v2 = map.get(v2).first;
}
//Remove the first element of the arraylist which is null and reverse the arraylist
path.remove(path.size()-1);
Collections.reverse(path);
return path;
}
public HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>> shortestCost(){
HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>> cost_prev_map = new HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>>();
for(Integer i : _vertices){
for(Integer j : _vertices){
if(i==j){
cost_prev_map.put(new Pair<Integer,Integer>(i,j),new Pair<Integer,Integer>(0,null));
}
else if(_edges.containsKey(new Pair<Integer,Integer>(i,j))){
cost_prev_map.put(new Pair<Integer,Integer>(i,j),new Pair<Integer,Integer>(_edges.get(new Pair<Integer,Integer>(i,j)),i));
}
else{
cost_prev_map.put(new Pair<Integer,Integer>(i,j),new Pair<Integer,Integer>(10000,null));
}
}
}
for(Integer k : _vertices){
for(Integer i : _vertices){
for(Integer j : _vertices){
if(cost_prev_map.get(new Pair<Integer,Integer>(i,j)).first > cost_prev_map.get(new Pair<Integer,Integer>(i,k)).first + cost_prev_map.get(new Pair<Integer,Integer>(k,j)).first){
cost_prev_map.put(new Pair<Integer,Integer>(i,j),new Pair<Integer,Integer>(cost_prev_map.get(new Pair<Integer,Integer>(i,k)).first + cost_prev_map.get(new Pair<Integer,Integer>(k,j)).first,cost_prev_map.get(new Pair<Integer,Integer>(k,j)).second));
}
}
}
}
//Check for negative cycles
for(Integer i : _vertices){
if(cost_prev_map.get(new Pair<Integer,Integer>(i,i)).first < 0){
throw new IllegalArgumentException("Graph contains negative cycle");
}
}
return cost_prev_map;
}
public ArrayList<Integer> costPath(Integer v1,Integer v2){
HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>> cost_prev_map = shortestCost();
ArrayList<Integer> path = new ArrayList<Integer>();
if(cost_prev_map.get(new Pair<Integer,Integer>(v1,v2)).first == 10000){
return path;
}
path.add(v2);
while(cost_prev_map.get(new Pair<Integer,Integer>(v1,v2)).second != null){
path.add(cost_prev_map.get(new Pair<Integer,Integer>(v1,v2)).second);
v2 = cost_prev_map.get(new Pair<Integer,Integer>(v1,v2)).second;
}
Collections.reverse(path);
return path;
}
public HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>> shortestCostDynamic(Integer v1, Integer v2){
HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>> cost_prev_map = new HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>>();
//Initialize the map with the first vertex having a distance of 0 and all other vertices having a distance of 10000
for(Integer i : _vertices){
if(i==v1){
cost_prev_map.put(new Pair<Integer,Integer>(i,0),new Pair<Integer,Integer>(0,null));
}
else{
cost_prev_map.put(new Pair<Integer,Integer>(i,0),new Pair<Integer,Integer>(10000,null));
}
}
//For each iteration of k
for(Integer k = 1; k < _vertices.size(); k++){
for(Integer i : _vertices){
for(Integer j : _vertices){
//If the vertex is an edge and the cost of the previous vertex is greater than the current vertex's cost
if(this.isEdge(j,i) && cost_prev_map.get(new Pair<Integer,Integer>(i,k-1)).first > cost_prev_map.get(new Pair<Integer,Integer>(j,k-1)).first + this.weight(j,i)){
//Set the cost of the current vertex to the cost of the previous vertex
cost_prev_map.put(new Pair<Integer,Integer>(i,k),new Pair<Integer,Integer>(cost_prev_map.get(new Pair<Integer,Integer>(j,k-1)).first + this.weight(j,i),j));
}
}
//If the vertex is not an edge and the cost of the previous vertex is greater than the current vertex's cost
if(!cost_prev_map.containsKey(new Pair<Integer,Integer>(i,k))){
//Set the cost of the current vertex to the cost of the previous vertex
cost_prev_map.put(new Pair<Integer,Integer>(i,k),new Pair<Integer,Integer>(cost_prev_map.get(new Pair<Integer,Integer>(i,k-1)).first,cost_prev_map.get(new Pair<Integer,Integer>(i,k-1)).second));
}
}
}
//Check for negative cycles
if(cost_prev_map.get(new Pair<Integer,Integer>(v1,v1)).first < 0){
throw new IllegalArgumentException("Graph contains negative cycle");
}
return cost_prev_map;
}
public ArrayList<Integer> costPathDynamic(Integer v1,Integer v2){
HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>> cost_prev_map = shortestCostDynamic(v1,v2);
ArrayList<Integer> path = new ArrayList<Integer>();
//If the cost of the last vertex is 10000(infinity), then there is no path
if(cost_prev_map.get(new Pair<Integer,Integer>(v2,_vertices.size()-1)).first == 10000){
return path;
}
//Add the last vertex to the path
path.add(v2);
Integer k = _vertices.size()-1;
//While the previous vertex is not null (the first vertex), add the previous vertex to the path, and set the current vertex to the previous vertex, and decrement k
while(cost_prev_map.get(new Pair<Integer,Integer>(v2,k)).second != null){
path.add(cost_prev_map.get(new Pair<Integer,Integer>(v2,k)).second);
v2 = cost_prev_map.get(new Pair<Integer,Integer>(v2,k)).second;
k--;
}
Collections.reverse(path);
return path;
}
}
Anul 1/Semestrul 2/Graph Algo/Labs/Lab 3/DirectedGraphJava/IDirectedGraph.java
+29
View File
@@ -0,0 +1,29 @@
package DirectedGraphJava;
import java.util.HashMap;
import java.util.Iterator;
import java.util.ArrayList;
interface IDirectedGraph {
public DirectedGraph reindex();
public Integer numVertices();
public Integer numEdges();
public Iterator<Integer> vertices();
public Iterator<Pair<Pair<Integer,Integer>,Integer>> edges();
public boolean isEdge(Integer v1, Integer v2);
public int inDegree(Integer v);
public int outDegree(Integer v);
public Iterator<Integer> inbounds(Integer v);
public Iterator<Integer> outbounds(Integer v);
public Integer weight(Integer v1, Integer v2);
public void weight(Integer v1, Integer v2, Integer w);
public void addVertex(Integer v);
public void removeVertex(Integer v);
public void addEdge(Integer v1, Integer v2, Integer w);
public void removeEdge(Integer v1, Integer v2);
public HashMap<Integer,Pair<Integer,Integer>> shortestPath(Integer v);
public HashMap<Integer,Pair<Integer,Integer>> shortestPath(Integer v,Integer u);
public HashMap<Pair<Integer,Integer>,Pair<Integer,Integer>> shortestCost();
public ArrayList<Integer> path(Integer v1,Integer v2);
public ArrayList<Integer> costPath(Integer v1,Integer v2);
}
Anul 1/Semestrul 2/Graph Algo/Labs/Lab 3/DirectedGraphJava/Main.java
+68
View File
@@ -0,0 +1,68 @@
package DirectedGraphJava;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Iterator;
public class Main {
public static DirectedGraph read_from_file(String filename) throws FileNotFoundException {
DirectedGraph graph = new DirectedGraph();
File file = new File(filename);
Scanner scanner = new Scanner(file);
Integer num_vertices = scanner.nextInt();
for(Integer i = 0; i < num_vertices; i++)
graph.addVertex(i);
Integer num_edges = scanner.nextInt();
for(Integer i = 0; i < num_edges; i++){
Integer v1 = scanner.nextInt();
Integer v2 = scanner.nextInt();
Integer w = scanner.nextInt();
graph.addEdge(v1, v2, w);
}
scanner.close();
return graph;
}
public static void write_to_file(DirectedGraph graph, String filename) throws IOException {
DirectedGraph new_graph = graph.reindex();
File file = new File(filename);
file.createNewFile();
FileWriter writer = new FileWriter(file);
writer.write(new_graph.numVertices().toString() + " " + new_graph.numEdges().toString() + "\n");
for(Iterator<Pair<Pair<Integer, Integer>,Integer>> edge = new_graph.edges(); edge.hasNext();){
Pair<Pair<Integer, Integer>,Integer> e = edge.next();
writer.write(e.first.first.toString() + " " + e.first.second.toString() + " " + e.second.toString() + "\n");
}
writer.close();
}
public static DirectedGraph random_graph(Integer num_vertices, Integer num_edges) {
DirectedGraph graph = new DirectedGraph();
for(Integer i = 0; i < num_vertices; i++)
graph.addVertex(i);
for(Integer i = 0; i < num_edges; i++){
Integer v1 = (int)(Math.random() * num_vertices);
Integer v2 = (int)(Math.random() * num_vertices);
Integer w = (int)(Math.random() * 100);
if(graph.isEdge(v1, v2)){
i--;
continue;
}
graph.addEdge(v1, v2, w);
}
return graph;
}
public static void main(String[] args) {
ui UI = new ui();
UI.run();
}
}
Anul 1/Semestrul 2/Graph Algo/Labs/Lab 3/DirectedGraphJava/Pair.java
+30
View File
@@ -0,0 +1,30 @@
package DirectedGraphJava;
public class Pair<T1,T2> {
public T1 first;
public T2 second;
public Pair(T1 first, T2 second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Pair<?, ?> pair = (Pair<?, ?>) o;
if (first != null ? !first.equals(pair.first) : pair.first != null) return false;
return second != null ? second.equals(pair.second) : pair.second == null;
}
@Override
public int hashCode() {
int result = first != null ? first.hashCode() : 0;
result = 31 * result + (second != null ? second.hashCode() : 0);
return result;
}
}
Anul 1/Semestrul 2/Graph Algo/Labs/Lab 3/DirectedGraphJava/ui.java
+330
View File
@@ -0,0 +1,330 @@
package DirectedGraphJava;
import java.util.HashMap;
import java.util.Iterator;
import java.util.ArrayList;
public class ui {
private DirectedGraph graph = new DirectedGraph();
public ui(){
}
public void run(){
Integer command;
while(true){
if(this.graph.numVertices() == 0)
System.out.println("Graph is empty");
System.out.println();
System.out.println("1. Load graph from file");
System.out.println("2. Save graph to file");
System.out.println("3. Generate a graph");
System.out.println("4. Add a vertex");
System.out.println("5. Remove a vertex");
System.out.println("6. Add an edge");
System.out.println("7. Remove an edge");
System.out.println("8. Get in degree");
System.out.println("9. Get out degree");
System.out.println("10 Get cost");
System.out.println("11. Set cost");
System.out.println("12. Get number of vertices");
System.out.println("13. Get number of edges");
System.out.println("14. Get vertices");
System.out.println("15. Get edges");
System.out.println("16. Get inbounds");
System.out.println("17. Get outbounds");
System.out.println("18. Get all");
System.out.println("19. Get shortest path to all vertices");
System.out.println("20. Get shortest path to a vertex");
System.out.println("21. Get shortest cost path to a vertex");
System.out.println("0. Exit");
System.out.print("Command: ");
command = Integer.parseInt(System.console().readLine());
System.out.println();
switch(command){
case 1: {
System.out.print("File name: ");
String fileName = System.console().readLine();
try{
this.graph = Main.read_from_file(fileName);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 2: {
System.out.print("File name: ");
String fileName = System.console().readLine();
try{
Main.write_to_file(this.graph, fileName);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 3: {
System.out.print("Number of vertices: ");
Integer numVertices = Integer.parseInt(System.console().readLine());
System.out.print("Number of edges: ");
Integer numEdges = Integer.parseInt(System.console().readLine());
try{
this.graph = Main.random_graph(numVertices, numEdges);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 4: {
System.out.print("Vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
try{
this.graph.addVertex(vertex);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 5: {
System.out.print("Vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
try{
this.graph.removeVertex(vertex);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 6: {
System.out.print("Vertex 1: ");
Integer vertex1 = Integer.parseInt(System.console().readLine());
System.out.print("Vertex 2: ");
Integer vertex2 = Integer.parseInt(System.console().readLine());
System.out.print("Weight: ");
Integer weight = Integer.parseInt(System.console().readLine());
try{
this.graph.addEdge(vertex1, vertex2, weight);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 7: {
System.out.print("Vertex 1: ");
Integer vertex1 = Integer.parseInt(System.console().readLine());
System.out.print("Vertex 2: ");
Integer vertex2 = Integer.parseInt(System.console().readLine());
try{
this.graph.removeEdge(vertex1, vertex2);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 8: {
System.out.print("Vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
try{
System.out.println("In degree: " + this.graph.inDegree(vertex));
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 9: {
System.out.print("Vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
try{
System.out.println("Out degree: " + this.graph.outDegree(vertex));
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 10: {
System.out.print("Vertex 1: ");
Integer vertex1 = Integer.parseInt(System.console().readLine());
System.out.print("Vertex 2: ");
Integer vertex2 = Integer.parseInt(System.console().readLine());
try{
System.out.println("Cost: " + this.graph.weight(vertex1, vertex2));
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 11: {
System.out.print("Vertex 1: ");
Integer vertex1 = Integer.parseInt(System.console().readLine());
System.out.print("Vertex 2: ");
Integer vertex2 = Integer.parseInt(System.console().readLine());
System.out.print("Weight: ");
Integer weight = Integer.parseInt(System.console().readLine());
try{
this.graph.weight(vertex1, vertex2, weight);
}
catch(Exception e){
System.out.println("Error: " + e.getMessage());
}
break;
}
case 12: {
System.out.println("Number of vertices: " + this.graph.numVertices());
break;
}
case 13: {
System.out.println("Number of edges: " + this.graph.numEdges());
break;
}
case 14: {
System.out.println("Vertices: ");
for(Iterator<Integer> vertex = this.graph.vertices(); vertex.hasNext();){
System.out.println(vertex.next());
}
break;
}
case 15: {
System.out.println("Edges: ");
for(Iterator<Pair<Pair<Integer, Integer>,Integer>> edge = this.graph.edges(); edge.hasNext();){
Pair<Pair<Integer, Integer>,Integer> e = edge.next();
System.out.println(e.first.first + " " + e.first.second + " " + e.second);
}
break;
}
case 16: {
System.out.print("Vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
System.out.println("Inbounds: ");
for(Iterator<Integer> inbounds = this.graph.inbounds(vertex); inbounds.hasNext();){
Integer e = inbounds.next();
System.out.println(e);
}
break;
}
case 17: {
System.out.print("Vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
System.out.println("Outbounds: ");
for(Iterator<Integer> outbounds = this.graph.outbounds(vertex); outbounds.hasNext();){
Integer e = outbounds.next();
System.out.println(e);
}
break;
}
case 18:{
System.out.println("Inbounds: ");
for(Iterator<Integer> vertex = this.graph.vertices(); vertex.hasNext();){
Integer v = vertex.next();
System.out.print(v);
System.out.print(": ");
for(Iterator<Integer> inbounds = this.graph.inbounds(v); inbounds.hasNext();){
Integer e = inbounds.next();
System.out.print(e);
System.out.print(" ");
}
System.out.println();
}
System.out.println();
System.out.println("Outbounds: ");
for(Iterator<Integer> vertex = this.graph.vertices(); vertex.hasNext();){
Integer v = vertex.next();
System.out.print(v);
System.out.print(": ");
for(Iterator<Integer> outbounds = this.graph.outbounds(v); outbounds.hasNext();){
Integer e = outbounds.next();
System.out.print(e);
System.out.print(" ");
}
System.out.println();
}
System.out.println();
System.out.println("Edges: ");
for(Iterator<Pair<Pair<Integer, Integer>,Integer>> edge = this.graph.edges(); edge.hasNext();){
Pair<Pair<Integer, Integer>,Integer> e = edge.next();
System.out.println(e.first.first + " " + e.first.second + " " + e.second);
}
break;
}
case 19:{
System.out.println("Enter a vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
HashMap<Integer, Pair<Integer, Integer>> distances = this.graph.shortestPath(vertex);
for(Iterator<Integer> vertex2 = this.graph.vertices(); vertex2.hasNext();){
Integer v = vertex2.next();
System.out.println("Distance from " + vertex + " to " + v + ": " + distances.get(v).second);
System.out.println("Path: ");
if(this.graph.path(vertex, v).isEmpty()){
System.out.println("No path");
continue;
}
for(Iterator<Integer> path = this.graph.path(vertex, v).iterator(); path.hasNext();){
Integer p = path.next();
System.out.print(p);
System.out.print(" ");
}
System.out.println();
}
break;
}
case 20:{
System.out.println("Enter a vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
System.out.println("Enter a second vertex: ");
Integer vertex2 = Integer.parseInt(System.console().readLine());
HashMap<Integer, Pair<Integer, Integer>> distances = this.graph.shortestPath(vertex, vertex2);
System.out.println("Distance from " + vertex + " to " + vertex2 + ": " + distances.get(vertex2).second);
System.out.println("Path: ");
if(this.graph.path(vertex, vertex2).isEmpty()){
System.out.println("No path");
break;
}
for(Iterator<Integer> path = this.graph.path(vertex, vertex2).iterator(); path.hasNext();){
Integer p = path.next();
System.out.print(p);
System.out.print(" ");
}
System.out.println();
break;
}
case 21:{
System.out.println("Enter a vertex: ");
Integer vertex = Integer.parseInt(System.console().readLine());
System.out.println("Enter a second vertex: ");
Integer vertex2 = Integer.parseInt(System.console().readLine());
ArrayList<Integer> path = this.graph.costPathDynamic(vertex, vertex2);
if(path.isEmpty()){
System.out.println("No path");
break;
}
System.out.println("Path: ");
for(Iterator<Integer> p = path.iterator(); p.hasNext();){
Integer v = p.next();
System.out.print(v);
System.out.print(" ");
}
Integer cost = 0;
for(Integer i=0; i<path.size()-1; i++){
cost += this.graph.weight(path.get(i), path.get(i+1));
}
System.out.println();
System.out.println("Cost: " + cost);
break;
}
case 0:{
System.exit(0);
}
default: {
System.out.println("Invalid option");
break;
}
}
}
}
}