import pandas as pd
import numpy as np
import networkx as nx

%matplotlib inline
%config InlineBackend.figure_format = 'retina'
import matplotlib.pyplot as plt
from pylab import rcParams
from queue import Queue

# Import starter files

G = nx.from_numpy_matrix(np.array(adjacency_matrix))

MST = nx.minimum_spanning_tree(G)

# directed graph, bfe_tree and dfs_tree are the same
directed_MST = nx.bfs_tree(MST, 0)

nodeTA = {}

for node in directed_MST.nodes:
    for home in list_of_homes:
        if nx.has_path(directed_MST, node, int(home)):
            nodeTA[node] = nodeTA.get(node, 0) + 1


queue = Queue()
queue.put(starting_car_location)
visitedNodes = []

while not queue.empty():
    node = queue.get()
    numTA = nodeTA.get(node, 0)

    if numTA > 1:
        neighbors = directed_MST.neighbors(node)
        for neighbor in neighbors:
            queue.put(neighbor)
        visitedNodes.append(node)

print(visitedNodes)