Skip to content

MMF NSU.GA laboratory works, 3 course. Dijkstra's algorithm and algorithm for finding blocks in a graph.

Notifications You must be signed in to change notification settings

TDaryaT/Gaphs_and_alg

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Gaphs_and_alg

MMF NSU.GA laboratory works, 3 course.

Image

Dijkstra's Algorithm (Minimum Path Search)

The report and a detailed description of the algorithm can be found here

Illustration for one of the tests:

The algorithm for finding blocks in a graph (using DFS)

The report and a detailed description of the algorithm can be found here

About

MMF NSU.GA laboratory works, 3 course. Dijkstra's algorithm and algorithm for finding blocks in a graph.

Topics

Resources

Stars

Watchers

Forks

Languages