
	June 9, 2000, Release 2.0.3

	- Changed the plugin interface make custom plugins much easier.
	- Created a generic method for obtaining internal property 
	    accessors from a graph with the get_vertex_property(g,tag)
	    and get_edge_property(g,tag) functions.
	- Fixed various bugs in how edge plugins are stored and accessed
	  for undirected and bidirectional graphs.
	- Added a dynamic_graph class. 
	- Did a lot of work to make these changes compile on VC++.


	May 26, 2000 

	Changed the vertex descriptor type for adjacency_list and
	bidir_adj_list to just size_type, and vertex_iterator
	to boost::int_iterator. Also changed how internal vertex
	properties work. The property accessor now keeps the
	pointer to the plugins. The user interface changed for
	internal accessor creation: now use get_color_accessor(G)
	functions.

	Changed the logic in weighted_edge_visitor to fix bug that
	I just introduced. Added a contains() member function
	to mutable_queue so we can use that instead of relying
	on the old hack of using the distance vector for queue
 	membership information. This uses more space, but it
	is more generic, allows us to use weighted_edge_visitor
	with arbitrary comparison operators (instead of assuming
	less than with max() indicated an untouched element).

	
	May 25, 2000 Snapshot 2.0.2-1

	Bug fix: the incidence_iterator class was changed so that it flips
	the source/target appropriately when dealing with in-edges.

	Changed graph_traits<G>::incidence_iterator to
	graph_traits<G>::out_edge_iterator and added a new typedef for
	graph_traits<G>::in_edge_iterator which will be used for in-edges
	instead of incidence_iterator

	Bug fix: changed how bidir_adj_list deals with edge plugins so
	that duplicate copies of the edge properties are not kept in each
	edge-list. Instead the in-edge list keeps pointers to the
	properties in the other list. This fix required some extensive
	changes to the bidir_edge, adjacency_list, and bidir_adj_list
	classes. If the edge-list is a vector we use a separate
	linked list for the edge properties, with pointers into
	that list from both the in-edge lists and out-edge lists.

	Pulled out the funcionality common to adjacency_list and
	bidir_adj_list and put it in the adj_list_base class. Now
	bidir_adj_list inherits from that instead of adjacency_list.
	This made it easier to implement the above fix.
	
	Changed the push() function used in adjacency_list to return an
	iterator to the thing inserted.

	Added a best_first_search() algorithm and made some changes to
	weighted_edge_visitor to accomodate it.

	Added the file dependencies example.

	Updated the boost directory with new version from boost.

	Removed the AC_TYPE_SIZE_T from configure.in because it was
	interfering with std::size_t.

	
	
	May 15, 2000 Release 2.0.1-2

	Initial release of GGCL 2.0. Changed interface to
	conform to the BOOST graph interface.
