Data science is a very visual field of computer science where everything needs to be depicted graphically in order to derive new forms of data and conclusions from it. This paper introduces visualization techniques where graphs can be better rendered using advance techniques such as vertex and edge clipping against the view port, rendering a large drawing area by panning the view port to focus on a specific region, labelling vertex data with numeric , text and images and advanced analytic algorithms such as analyzing and finding the shortest path between two vertices using Dijkstra’s, Floyd, finding the minimum spanning tree using Prims and Kruskal’s and traversing all vertices in a graph using Breadth first search and Depth first search. Practically any issue if it can be condensed into a graph data structure format can be sent to this program and are graphically evaluated to discover new information. This paper explains the above-mentioned techniques in detail and how they can work together to create an advanced visualization tool for data scientists working with bidirectional weighted relational data that is graphs.