L. 3 (2002–2006)
L. 4 (2006–2010)
L. 5 (2010–2012)
L. 6 (2012–)
All networks are directed graphs drawn with the Fruchterman-Reingold force-directed algorithm. The ties connect the first author of each bill to the cosponsors of that bill. The nodes are sized by unweighted total degree. When two nodes belong to the same group, any existing tie between them is given the color of that group. There is a guide to party codes and colors at the end of this page.
See the interactive visualization, or view other countries.
L. 2 (1998–2002)
L. 3 (2002–2006)
L. 4 (2006–2010)
L. 5 (2010–2012)
L. 6 (2012–)
