Compressing Natural Graphs and a Practical Work-Efficient Parallel Connectivity Algorithm