noah-patullo
Here are 17 public repositories matching this topic...
Algorithm to test if a given graph is Bipartite or not
-
Updated
Apr 8, 2017 - Java
Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
-
Updated
May 28, 2017 - Java
Shortest Paths from every vertex to a goal vertex allowing negative-weight edges (when Dijkstra's fails)
-
Updated
May 30, 2017 - Java
Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.
-
Updated
Jun 11, 2017 - Java
Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution
-
Updated
Jun 22, 2017 - Java
Network Flow: Given a directed graph with edge capacities and vertex demands, is there a circulation of flow?
-
Updated
Jul 20, 2017 - Java
Application of Breadth-First Search to see if a directed graph is Strongly Connected
-
Updated
Jul 30, 2017 - Java
Finds a Topological Ordering of vertices in a Directed Acyclic Graph
-
Updated
Aug 3, 2017 - Java
Greedy Algorithm to find the maximum number of mutually compatible jobs
-
Updated
Aug 7, 2017 - Java
Greedy Algorithm to minimize lateness when scheduling jobs on a processor
-
Updated
Aug 7, 2017 - Java
Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph
-
Updated
Aug 9, 2017 - Java
Algorithm to find possible sets in the game Set using an iterative implementation of n choose 3 for combinations
-
Updated
Nov 28, 2017 - Java
Command line implementation of the board game Mastermind for a Software Engineering class
-
Updated
Feb 13, 2018 - Java
A GPA calculator in JavaFX attempting to use the Model View Controller (MVC) pattern
-
Updated
May 30, 2018 - Java
Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)
-
Updated
Jan 5, 2019 - Java
Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover
-
Updated
Jan 12, 2019 - Java
Improve this page
Add a description, image, and links to the noah-patullo topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the noah-patullo topic, visit your repo's landing page and select "manage topics."