Before revision:  To achieve this with limited workspace, we introduce a compact representation of planar graphs , called an s-net which allows us to manipulate its component structure during the execution of the algorithm .
After revision:  To achieve this with limited workspace, we introduce a compact representation of planar graphs , called an s-net which allows us to efficiently maintain and update the components of the current minimum spanning forest as the edges are being inserted .