function bestNodeList = diameter(startNodes, adjMat)
% find a longest path through the graph

emptyVisited = zeros(size(adjMat,1),1);
bestNodeList = [];

for si=1:length(startNodes),
	startNode = startNodes(si);
	nodeListI = dfs(startNode, adjMat, emptyVisited);
	if (length(nodeListI)>length(bestNodeList)),
		bestNodeList=nodeListI;
	end
end