Skip to content

Latest commit

 

History

History
82 lines (43 loc) · 1.95 KB

DOCS.md

File metadata and controls

82 lines (43 loc) · 1.95 KB

Documentation

You need to clone our repository and run the app using

./gradlew run

How to use

Firstly, you need to choose a graph

graph-choose

Undirected unweighted graph

Here is the example of our graph window

graph

If you click "Reset", graph will become as it was before you started manipulating it.

If you click "Algorithms", you will be suggested to use algorithms of this graph

graph-algos

Bridges

Bridge edges are highlighted with red color.

bridge

Cycles search for given vertex

You are suggested to put in a number of chosen vertex

cycles-vertex-choose.png

Then you receive highlighted cycle of this vertex, or vertex becomes highlighted with blue color if it doesn't belong to any cycle

cycle

Key vertices selection

You receive highlighted key vertices of this graph

key-vertices

Directed unweighted graph

Directed graph has some undirected graph algorithms, but also there is selection of strongly connected components.

Strongly connected components selection

Each component is highlighted with its unique color.

scc

Undirected weighted graph

In weighted graph, you can see weights of edges

edges-weights

Minimal spanning tree construction

Included edges are highlighted with red

mst

Path finding

To find a path, you need to pick source and destination vertices

path-vertices

Path is highlighted. Notice that we don't support negative weights for path finding in undirected graph.

path

Weighted directed graph

All its algorithms are already explained above