Skip to content

The program solves the next task: you need to transport ants from start to end of the graph. The program makes in the most optimal way.

Notifications You must be signed in to change notification settings

livankrekh/lem_in

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

33 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

lem_in (42 algorithms project on C)

Describe

Project based on using algorithm set:

Depth-first search - algorithm for search all posible ways

Dijkstra's algorithm - algorithm uses for search and sorting all ways and find short ways

Floyd's-Warshall's algorithm - alternative algorithm for graph with edge weight

Most profitable ways group choosing algorithm - my own algorithm for choosing group of ways (in this project I use several ways in the same time) as result of search

About

The program solves the next task: you need to transport ants from start to end of the graph. The program makes in the most optimal way.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published