In recent years, Vehicular Networks have received much attention because they can contribute to solving several problems of urban scenarios. An interesting perspective to characterize these urban problems is to study vehicles' mobility records to increase our knowledge about them. Thus, an alternative is to model these records as graphs enabling us to apply algorithms and graph theory to design new solutions for vehicular networks. This work explores three different strategies to model vehicular networks and analyzes two real well-known traces from Rome and San Francisco. We perform a study on the network aspect, measuring metrics that portray some network characteristics and proprieties. We highlight the advantages and limitations of each approach evaluated. Also, we present some applications and future directions for the knowledge extracted with this analysis.