Zig-Zags
In some category C, a zig-zag of morphisms from x0 to xn is a sequence of objects x1,x2,…,xn−1,xn and morphisms (fn) so that each morphism fi goes either x1→xn+1 or xn+1→xn.
For instance,
x1f1⟵x2f2⟵x3f3⟶x4f4⟶⋯fn−1⟵xn
Note that WLOG we can always assume that the zig-zag is alternating. If it is not, we may compose morphisms so that it is. The above example, for instance, would become
x1f1f2⟵x3f4f3⟶⋯fn−1⟵xn
A category is called connected if any two objects have a zig-zag between them.
As far as I can tell, this is mostly interesting in the cases where the morphisms composing the zig-zags are in some sense ‘reversible’, so that they form a ‘line’ of sorts. For instance, if our zig zag consists only of isomorphisms, then despite the fact that we’re given the isomorphisms in alternating fashion, we can flip the right ones around to produce a big isomorphism x1≅xn.