does anyone know of a good resource online that gives code when explaining how to implement a graph using an adjacency list. cause i have to write a program that is a templated graph that can handle being directed or not directed and/ weighted or unweighted. and i have the public part of the graph.h file that i was give. but i have to come up with the protected and private stuff and then implement it all in the .cpp file and i dont even know were to start how to implement this. i have read thru the chapter in my book and it doesnt help me at all and i cant seem to find anything online. but if someone knows of a good resource that would be great. thanks :)

How about this? The Graph Templay Library.
http://infosun.fmi.uni-passau.de/GTL/

i have emailed them and waiting on getting a response so i can download there source. but if something happens that i cant get it does anyone else have a copy of this source or anything else that would be usefull to me. :) thanks