Shortest paths problem

Structure of the project:

• analysis of the algorithms and demonstration of the results - report
• implementation of the algorithms:
  • A star algorithm
  • Dijkstra's algorithm
  • Bellman–Ford algorithm
  • Johnson's algorithm
  • Floyd–Warshall algorithm
  • Matrix Multiplication
• structure of the Graph
• counting of the connected components
• stress tests
• experiments
• experiments with real-life graphs
• input and output data