id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
252	Smaller iterator classes for some graph structures	Peter Kovacs	Peter Kovacs	"All the `NodeIt`, `ArcIt`, `EdgeIt` etc. iterator classes stores a pointer for the underlying (di)graph. However it wouldn't be necessary in some cases.

E.g. `SmartDigraph::next(Node&)` and `SmartDigraph::next(Arc&)` are static functions. Thus `SmartDigraph::NodeIt` and `SmartDigraph::ArcIt` could be implemented without a pointer to the graph. The three `next()` functions of `SmartGraph` are not static, but they could/should be. The special graph structures (`FullGraph`, `HypercubeGraph`, `GridGraph`) also have static `next()` functions."	enhancement	assigned	major	LEMON 1.4 release	core	hg main