hi all, i'm a phd student at kent state university and have been contemplating submitting a proposal for google's summer of code to do some work with the boost libraries. as a long-time user, i thought it might be a good idea to try to give something back. i wasn't really sure who to contact, so i thought i'd post this here. i had originally thought to work on a generic tree library since i wrote a generic binary tree library last semester, but since the wiki now reports about 5 proposals, i decided agaisnt it. instead, i decided that i might give a shot at working with the boost graph library since i've been using it lately for large network measures. specifically, i'm interested developing directed and undirected graph interfaces to the adjacency list class. if there's any interest, please let me know. i could write and submit a proposal sometime over the weekend. thanks, andrew sutton asutton@cs.kent.edu