To track the number of times a node is explored during the search, the $`$ExplorableGraph$`$ wrapper is used on the networkx Graph class. Every time you process a node, by calling $`$graph$.$neighbors$($node$)`,$ the count for that node increases by one. You will need to use one of these methods to add a node's neighbors to the search queue, just be careful not to call it unnecessarily throughout your code. We have created the $`$graph$.$get$\_$edge$\_$weight$($u$,$ v$)`$ method to be used to access edge weights between two nodes, $`$u$`$ and $`$v$`.$ All other normal $`$networkx$`$ Graph operations can be performed. Exercise specific details can be found in the exercise descriptions below.