\subsection{Algorithm Specifications}\index{Algorithm!Specifications}

\vspace*{1in}

The starred algorithms are finished, and the other algorithms are 
ranked in order of urgency.  Hopefully these rankings will not be
necessary after July 31st, 1996.

\begin{tabular}{|l|l|l|l|l|}   \hline
Priority & Algorithm/Property&	input &	output	&		attr's \& algs used \\ \hline \hline
%-----------------	-----	------			-----------
2&Biconnected	&	Undir.&  Set$<$Set$<$Vertex*$>$ $>$&	DFS - back \\ 
&Components	&	G&	&			DFS - low \\ 
&		&	&	&			DFS - discovery\_time \\
\hline
5&Bipartite Matching&	Undir.&	Set$<$Edge*$>$&		weight \\ 
&		&	G&		&		Ford-Fulkerson - flow\\ 
\hline
*&Breadth-First Search&	G,v&	Sequence$<$Vertex*$>$&	color\\ 
&		&	&	&			distance\\ 
&		&	&	&			???\\ 
\hline
*&Depth-First Search&	G&	Sequence$<$Vertex*$>$&	color\\ 
&		&	&	&			starttime\\ 
&		&	&	&			finishtime\\ 
&		&	&	&			back\\ 
&		&	&	&			low\\ 
&		&	&	&			pred\\ 
\hline
3&Dijkstra's Single&	G, v&	Set$<$double$>$	&	weight\\ 
&Source Shortest &	&	&			distance\\ 
&Paths		&	&	&			pred\\ 
\hline
4&Ford-Fulkerson&		Network &double	&		flow\\ 
&Maximum Flow &		s, t&		&		capacity\\ 
&		&	&	&			partition\\ 
\hline
7*&Floyd-Warshall&	G&	Matrix$<$double$>$&		weight\\ 
&All Pairs Shortest&	&	&			distance\\
&Paths		&	&	&			pred\\ 
\hline
*&Kruskal's MST&		G&	Set$<$Edge*$>$&		weight\\ 
&		&	&	&			mark\\ 
&		&	&	&			parent\\ 
&		&	&	&			pred\\ 
\hline
6&Prim's MST&		G&	Set$<$Edge*$>$&		weight\\ 
&		&	&	&			key\\ 
&		&	&	&			pred\\ 
\hline
1&Strongly-Connected&	Digraph &Set$<$Set$<$Vertex*$>$ $>$&	DFS - mark\\ 
&Components	&	&	&			DFS - finishtime\\ 
\hline
*&TopSort		&	DAG	&Sequence$<$Vertex*$>$&	DFS - finishtime\\ 
\hline
\end{tabular}