id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
377	Smaller version of StaticDigraph	Peter Kovacs	Alpar Juttner	"The current implementation of `StaticDigraph` stores `2n+4m` int values (for `n` nodes and `m` arcs). However, in many cases, one needs outgoing arc iteration only. For such cases, a static graph representation could be implemented with `n+2m` integers by fully omitting the outgoing and incomming arc lists (but arcs would be sorted by their source nodes).

The `NodeIt`, `ArcIt` and `OutArcIt` iterators could be implemented efficiently, but the basic iteration of the ougoing arcs would be somewhat slower (see #68 for antecedents). For ensuring the compatibility with the `Digraph` interface, an `InArcIt` iterator should also be implemented, but it would be really slow (as slow as full arc iteration).

What do you think? Would this data structure make sense?"	enhancement	closed	major	LEMON 1.4 release	core	hg main	done