Editing Pointer swizzling (section)

==Methods of swizzling==
Swizzling in the general case can be complicated. The reference [[graph (abstract data type)|graph]] of pointers might contain an arbitrary number of [[cycle (graph theory)|cycle]]s; this complicates maintaining a mapping from the old unswizzled values to the new addresses. [[Associative array]]s are useful for maintaining the mapping, while algorithms such as [[breadth-first search]] help to traverse the graph, although both of these require extra storage. Various [[serialization]] [[library (computing)|libraries]] provide general swizzling systems. In many cases, however, swizzling can be performed with simplifying assumptions, such as a [[tree (data structure)|tree]] or [[list (abstract data type)|list]] structure of references.

The different types of swizzling are:
* Automatic swizzling <!--[EXPAND]-->
* On-demand swizzling <!--[EXPAND]-->