\documentclass[11pt]{article}
\usepackage[margin=1in]{geometry}
\usepackage{amsmath}
\usepackage{listings}
\usepackage[usenames,dvipsnames]{color}
\lstset{
    language=python,
    basicstyle=\tt\small,
    commentstyle=\color{Green},
    keywordstyle=\color{blue},
    stringstyle=\color{Orange},
    keepspaces=true,
    showstringspaces=false,
    emphstyle=\color{Maroon},
    emph={__name__}
}

\setlength{\parindent}{0pt}
\setlength{\parskip}{4pt}


\begin{document}

\large
CS 228, HW \#9 \hfill Due: 4/11/2014

\textbf{Name:} your name here

\textbf{e-ID:} your e-ID here

\textbf{Acknowledgment statement:}


\hrule
\normalsize

\bigskip
Unless otherwise specified, the exercises listed below are from the
textbook \emph{Discrete Mathematics and Its Applications, 7th Ed.}, by
Kenneth H.~Rosen. \textbf{Please show all of your work and explain
  your reasoning; don't just give the final answer.} Submit your
\texttt{hw9.tex} and \texttt{hw9.pdf} files via Canvas before 1:00 PM
on the due date. As a reminder, late work will NOT be accepted.


\section*{Section 10.5 (page 703)}

\subsection*{Exercise 6}

\subsection*{Exercise 14}

\subsection*{Exercise 32}

\section*{Section 10.6 (page 716)}

\subsection*{Exercise 4}

\subsection*{Exercise 14}

\subsection*{Exercise 18}

\subsection*{Dijkstra's Algorithm}

Download and complete \verb+hw9.py+ from the course Canvas page.  Your modified version of Dijkstra's algorithm will need to keep track of the ``previous'' vertex for each vertex and construct the return value by traversing the previous vertices from $z$ back to $a$.   Upload your finished Python file. 

\section*{Section 10.8 (page 733)}

\subsection*{Exercise 4}
\textit{Your answer for this question should be in the form of an adjacency list with all vertices listed in alphabetical order.}

\subsection*{Exercise 8}

\section*{Section 11.1 (page 755)}

\subsection*{Exercise 4}

\subsection*{Exercise 22}

\subsection*{Exercise 28}


\end{document}

