# Find shortest path

Create graph and find the shortest path. On the Help page you will find tutorial video.

#### Create algorithm

Paste your algorith below and press RunYour algorithm was sent to check and in success case it will be add to site.

Select and move objects by mouse or move workspace

Drag cursor to move objects

Select and move objects by mouse or move workspace

Drag cursor to move objects

Click to workspace to add a new vertex. Vertex enumeration

Select first vertex of edge

Select second vertext of edge

Select the initial vertex of the shortest path

Select the end vertex of the shortest path

Shortest path length is %d

Path does not exist

Click on the object to remove

Add edge

Directed

Undirected

Adjacency Matrix

Save graph

Cancel

the lowest distance is

Incidence matrix

Saving Graph

close

The number of connected components is

The number of weakly connected components is

What do you think about the site?

Name (email for feedback)

Feedback

Send

To ask us a question or send us a comment, write us at

fix matrix

help

Matrix has wrong format

Save Graph Image

Full report

Short report

Graph has not Eulerian cycle

Graph has Eulerian cycle

Processing...

Custom text

Add vertex

Rename vertex

Rename

en

Edit weight

has no weight

Group rename

Vote

Recommend algorithms

Graph has not Eulerian path

Graph has Eulerian path

Graph of minimal distances

Check to save

Show distance matrix

Distance matrix

Select a source of the maximum flow

Select a sink of the maximum flow

Maximum flow from %2 to %3 equals %1

Flow from %1 in %2 does not exist

Source

Sink

Graph has not Hamiltonian cycle

Graph has Hamiltonian cycle

Graph has not Hamiltonian path

Graph has Hamiltonian path

Select start traversal vertex

Traversal order:

Edge bend