Added an adjacency iterator that may work for a bunch of different types of graphs - assuming there's a standard incidence iterator for all of them.