Shortest Paths from every vertex to a goal vertex allowing negative-weight edges (when Dijkstra's fails)
-
Updated
May 30, 2017 - Java
Shortest Paths from every vertex to a goal vertex allowing negative-weight edges (when Dijkstra's fails)
Finds a Topological Ordering of vertices in a Directed Acyclic Graph
Binary hexadecimal converter
Algorithm to find possible sets in the game Set using an iterative implementation of n choose 3 for combinations
Greedy Algorithm to find the maximum number of mutually compatible jobs
Invert Selection of checkboxes or radio buttons in an HTML form
Autofill NetID when logging into Blackboard & syncs across signed-in Chrome browsers
Reveal password fields with a keyboard shortcut or click of the Extension icon
Application of Breadth-First Search to see if a directed graph is Strongly Connected
A GPA calculator in JavaFX attempting to use the Model View Controller (MVC) pattern
Greedy Algorithm to minimize lateness when scheduling jobs on a processor
Algorithm to test if a given graph is Bipartite or not
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.
A list of projects I've worked on. GitHub's organization is lacking in my opinion, so this serves as an index & root of all my work (I'm Noah Patullo, not Pattullo or Patulo. I have a unique name & this should help clarify who I am)
Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
Command line implementation of the board game Mastermind for a Software Engineering class
Watch all videos from a channel in chronological order (oldest to newest)
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
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
Add a description, image, and links to the pattullo topic page so that developers can more easily learn about it.
To associate your repository with the pattullo topic, visit your repo's landing page and select "manage topics."