we give a bijection between parking functions and crossed bar diagrams and use it to derive properties of parking functions that play a crucial role in our attack on the shuffle conjecture. this is bijective combinatorics at its best, in that a simple bijective weight preserving correspondence between two families of objects allows us to prove difficult results about one family by working with the other. the talk will be completely self contained.