Implement:1. Dijkstra• Print out the progress table2. Ford-Bellman• Print out the progress table3. Floyd• Print out the matrix

Sure, I can help you with that. Here are the implementations for Dijkstra, Ford-Bellman, and Floyd algorithms in Python:

1. Dijkstra's Algorithm:

import sys

def dijkstra(graph, start_vertex):
    D = {v:float('inf') for v in graph}
    D[start_vertex] = 0

    unvisited = list(graph)

    while unvisited:
        current_vertex = min(unvisited, key=D.get)
        print(f"Currently considering {current_vertex} with a distance of {D[current_vertex]}")

        for neighbor, distance in graph[current_vertex].items():
            old_distance = D[neighbor]
            new_distance = D[current_vertex] + distance
            if new_distance < old_distance:
                D[neighbor] = new_distance

        unvisited.remove(current_vertex)

    return D

2. Ford-Bellman Algorithm:

def ford_bellman