Classical sequent calculus is a beautifully symmetric system but imposes an ordering on operations which makes too many distinctions from a semantic point of view. In this talk I propose to outline how someone seeking a more graphical representation is led to something like proof nets, and to explain why the only serious problem in adapting the standard linear technology is caused by weakening. Taking weakening as a rule in its own right, not as a nullary contraction, allows an extension of the standard Danos-Regnier switchings to cover it. This gives a notion of proof net for full classical propositional logic. We sketch the proof that any such net is sequentialisable (i.e. can be derived from a valid sequent proof). In this talk I shall only deal with statics.