Pinned Repositories
12DaysOfRecursion
An Example of Recursion Using A Classic Christmas Song for People I Tutor
actions-tutorial
MachineProblem3
run BFS and Belman Ford to determin useful edges, then record their iteration counts
MU3DPC
A repository dedicated to building an appropriate web application for the 3D printing club in mizzou
Node-Pool
OnTheSpot-Spot-Node
projectPATH
Prosthetics-Code
GZROS-Software-Tutorials
A Repository that stores a beginner software tutorial for robotics using ROS and Gazebo
NavBot
Interaze's Repositories
Interaze/Node-Pool
Interaze/OnTheSpot-Spot-Node
Interaze/12DaysOfRecursion
An Example of Recursion Using A Classic Christmas Song for People I Tutor
Interaze/actions-tutorial
Interaze/MachineProblem3
run BFS and Belman Ford to determin useful edges, then record their iteration counts
Interaze/MU3DPC
A repository dedicated to building an appropriate web application for the 3D printing club in mizzou
Interaze/projectPATH
Interaze/augur
Python library and web service for Open Source Software Health and Sustainability metrics & data collection.
Interaze/CS4320-1.1
Interaze/github-actions-course
Interaze/github-actions-course-react
Interaze/GitHubGraduation-2022
Join the GitHub Graduation Yearbook and "walk the stage" on June 11.
Interaze/GitMagic
Interaze/jenkins-demo
Interaze/me-vs-atom-pt2
Another feeble attempt to overcome my inability to manage a simple IDE, while still building a full stack website
Interaze/OnTheSpot
Interaze/RarePlanes
Interaze/SchoolProject-MachineProblem2
The output a minimal list of edges that, when added to G, make G strongly connected. For simplicity, the input DAG does not have any isolated vertices. Let s and t be the number of sources and sinks in G, respectively. Then it is possible to make G strongly connected by adding MAX(s , t) edges to it. This number is also the smallest possible since each source much have at least one new incoming edge, and each sink must have at least one new outgoing edge in the resulting graph. There may be several solutions, but all optimal solutions have MAX(s , t) edges. Your program will be tested by checking that you have the required number of edges in the output, and by verifying that the resulting graph is strongly connected. The input file simply lists the edges in arbitrary order as ordered pairs of vertices, with each edge on a separate line. The vertices are numbered in order from 1 to the total number of vertices.
Interaze/SIGTemplate
Example Code for curriculum I'm teaching