Floyd-Warshall Algorithm for Finding Shortest Paths in a Graph

Tema rada je traženje najkracih puteva u težinskom grafu. Potrebno je implementi- ´ rati i analizirati Floyd-Warshallov algoritam na razlicitim primjerima grafova. Korisnik ˇ pristupa aplikaciji kroz interaktivno sucelje koje treba ponuditi razne opcije generira- ˇ nja i unosa grafa.Topic of the work is searching for shortest paths in weighted graph. It is required to implement an analyze Floyd-Warshall algorithm on different graph examples. User approaches the application through interactive interface that needs to offer different options of generating and entering a graph