seanreed1111

require '../lib/Queue'

        frontier = Queue.new
        
# set up the adjacency list that defines the graph        

        neighbors = {}
        neighbors = {:a => [:b,:f], :b => [:c,:d], :c => [:e], :d =>[:e], :e =>[:c,:d], 
                                        :f => [:a,:g,:h,:i], :g => [:f], :h => [:f], :i => [:f] }
        parent = {}

seanreed1111

class SimpleQueue
  def initialize
    @queue = Array.new
  end

  #adds item to back of queue and returns the queue
  def enqueue(item)
    @queue.unshift(item)
  end

seanreed1111

class SimpleStack
	def initialize
	  @stack = Array.new
	end

	#removes the first item from the stack and returns the item popped
	def pop 
	  @stack.pop
	end

seanreed1111

def fizzbuzz(number)
  if number % 15 == 0
      "Fizzbuzz"
  elsif number % 3 == 0
      "Fizz"
  elsif number % 5 == 0
      "Buzz"
  else
      number        
  end