Traversal sets vije e we define the edge's traversal set tij= {(s, t) e v x v| some shortest path s t contains ij} and traversal set induced graph g[t] = (v', e'), where v' {ke v| (k, t) e tij or (s, k) e tijh, and e' = {(s, t) e tij}. homework (due 9/17/2019): prove that git is bipartite.