A web tool to build, edit and analyze graphs. Great help for students and developers studying algorithms and data structures.

• build a graph and translate it into adjacency matrix, adjacency list or Java code

• visualize a graph from a given adjacency matrix or adjacency list

• generate a random graph with desired predefined properties

• run algorithms and visualize the results

• Find Tree Center
• Find Shortest Path - Dijkstra's
• Find Shortest Path - Bellman-Ford
• Find Minimum Spanning Tree
• Find Strongly Connected Components
• Find Bridges
• Find Articulation Points
• Find Shortest Path - DAG
• Find Longest Path - DAG
• Find Topological Order
• Find Eulerian Path