Shortly after working on my Steam Friends Graph ,I had the idea of extending the project to include the GitHub network. I used BrickHack V as the opportunity to work on this project with my friends. Rather than simply use the code that was used in the Steam friends graph, the architecture was completely revamped to reflect both the differences between the Steam and GitHub networks and my improved web development skills.

Project Overview

We created an interactive website which allows you to make graphs based on the Github network. Currently the site generates three types of graphs– the most popular and entertaining of which is the friends graph. The friends graph helps you visualize clusters of friends/collaborators on GitHub. Similar to the Steam Friends Project, I hope that this project will make people more interested in learning about big data. The visual aspect of this website makes learning about topics such as clustering and graph databases more intuitive.

This project utilizes the steam API and graph databases to create friend graphs for clients in a web browser. Currently there are two types of graphs available: - Friends of Friends Graph: This graph displays all the steam friends of a single person and all their friend’s friends. - Common Friends Graph: This graph will only display your friends; however, it will draw edges between your friends’ if they are friends with each other.

Motivation

Musical Floppy Drive Build Log

Tue Mar 13 2018

It is fun to find an interesting use for old technology. Being someone who has tons of old floppy drives and loves music, I decided to turn my old floppy drives into an orchestra. I’m not sure where I first learned about musical floppy drives, however, there are thousands of videos on YouTube.

This project first started over a year ago when I connected two floppy drives to a Raspberry Pi to play the Star Wars theme.

Musical Floppy Drives

Fri Jan 27 2017

Java Fibonacci Solver

Sun Apr 19 2015

The Fibonacci Sequence is a series of numbers where the next number is found by adding the previous two numbers.

Ex:

n

1

2

3

4

5

6

x

1

1

2

3

5

8

class Fibonacci
{
public staticvoidmain(String[] args)
{
for(int i = 1; i < 60; i ++)
{
System.out.println("Fibonacci " + i + " is: t" + fib(i));
}
}
//recursive definition of Fibonacci
public staticdoublefib(int n)
{
if(n == 1 \|\| n == 2)
{
return(1);
}
return(fib(n -1) + fib(n -2));
}
}