Skip to content

Instantly share code, notes, and snippets.

View tareq-si-salem's full-sized avatar

Tareq Si Salem tareq-si-salem

View GitHub Profile
@tareq-si-salem
tareq-si-salem / MSTGui.java
Created August 6, 2016 17:40
Prim-Jarnik and Kruksal to find a Minimal Spanning Tree of a connected graph GUI version
import java.util.ArrayList;
import java.util.Arrays;
import javafx.application.Application;
import javafx.scene.Scene;
import javafx.scene.layout.HBox;
import javafx.scene.layout.Pane;
import javafx.scene.paint.Color;
import javafx.scene.shape.Circle;
import javafx.scene.shape.Line;
import javafx.scene.text.Font;
@tareq-si-salem
tareq-si-salem / MST.java
Last active August 6, 2016 17:33
Prim-Jarnik and Kruksal to find a Minimal Spanning Tree of a connected graph
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class MST {
public static void main(String[] args) {
@tareq-si-salem
tareq-si-salem / ShortestPathGUI.java
Created August 6, 2016 17:16
Implementation of the Dijkstra’s and Floyd-Warshall’s Algorithms GUI JavaFX
import java.util.ArrayList;
import java.util.Arrays;
import javafx.application.Application;
import javafx.scene.Scene;
import javafx.scene.layout.Pane;
import javafx.scene.paint.Color;
import javafx.scene.shape.Circle;
import javafx.scene.shape.Line;
@tareq-si-salem
tareq-si-salem / ShortestPath.java
Created August 6, 2016 16:30
Implementation of the Dijkstra’s and Floyd-Warshall’s Algorithms
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Scanner;
public class ShortestPath {
static DiGraph g;
static double d[];
static int path[];
@tareq-si-salem
tareq-si-salem / MainGUI.java
Created August 6, 2016 16:06
Visualizing DFS with a GUI version
import java.util.ArrayList;
import javafx.application.Application;
import javafx.scene.Scene;
import javafx.scene.layout.Pane;
import javafx.scene.paint.Color;
import javafx.scene.shape.Circle;
import javafx.scene.shape.Line;
import javafx.scene.shape.Polygon;
import javafx.scene.text.Font;
@tareq-si-salem
tareq-si-salem / Main.java
Created August 6, 2016 16:02
Show depth first search results
public class Main {
public static void main(String[] args) {
DiGraph diGraph = new DiGraph();
System.out.println(diGraph);
}
}
@tareq-si-salem
tareq-si-salem / DiGraph.java
Created August 6, 2016 16:01
DiGraph class definition (adjacency list) with depth first search results
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class DiGraph {
public int[] vertices;
public ArrayList<Integer> adjacencyList[];
private boolean[] explored, visited;
@tareq-si-salem
tareq-si-salem / Main.java
Created August 5, 2016 18:30
Comparing between Merge Sort, Heap Sort, Bubble Sort, Bin Sort
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
// testing if the four algorithms are correct
int length = 10;
int max = 100;
int min = 0;
@tareq-si-salem
tareq-si-salem / HuffmanCodeGenerator.java
Created August 5, 2016 17:58
File compression using Huffman Code
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintWriter;
public class HuffmanCodeGenerator {
@tareq-si-salem
tareq-si-salem / Main.java
Created August 5, 2016 17:58
File compression using Huffman Code
import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {