This is a simple graph visualiser. It can be used to visualise graphs in a simple way. It is written in javascript
-
You can select type of graph you want to visualise. You can choose between directed and undirected graph
-
You can add number of vertices you want to have in your graph using Add Node button dynamically.
-
You can add edges between vertices using the adjency matrix displayed.
- The matrix is editable. You can change the value of the matrix by clicking on the cell and entering the value.
- The matrix is symmetrical in undirected graph. If you change the value of the cell in row 1 and column 2, the value of the cell in row 2 and column 1 will also change.
- for the directed graph, the matrix is not symmetrical. If you change the value of the cell in row 1 and column 2, the value of the cell in row 2 and column 1 will not change. and is of form
Index Name of the to node Name of the from node weight of the edge -
Graph nodes span randomly inside the canvas. You can move them around using mouse by draging them. the edges will follow the nodes.
-
You can also apply Dijkstra's algorithm to find shortest path between two nodes. To do that you need to select two nodes and then click Dijkstra button. The shortest path will be displayed in red color. Apart from them you can also apply BFS and DFS algorithms to find all nodes that are reachable from the selected node. To do that you need to select one node and then click BFS or DFS button.( all the algorithms are applied on node 1).
-
You can also change the node label by changing the value in the text box in the leftmost column of the table.
- First you need to select type of graph you want to visualise. You can choose between directed and undirected graph
- Then you can add number of vertices you want to have in your graph using Add Node button
- Then you can add edges between vertices using the adjency matrix displayed.
- Graph nodes span randomly inside the canvas. You can move them around using mouse by draging them. the edges will follow the nodes.