please help me convert this java code into python

import java.util.*; public class Dijkstra{ public static void main(String args[]) { int source,destination,i,j,V; Scanner input=new Scanner(System.in); System.out.print("Please enter the number of vertices : "); V=input.nextInt(); int graph[][]=new int[V][V]; System.out.printf(" Please enter the adjecent matrix : "); for(i=0;i"+current); } public static void dijkstra(int graph[][], int source,int destination,int V) { int dist[]=new int[V],i,count; int prev[]=new int[V]; boolean sptSet[]=new boolean[V]; for ( i = 0; i < V; i++) dist[i] = Integer.MAX_VALUE ; sptSet[i] = false; prev[i]=-1; dist[source] = 0; prev[source]=-1; for (count = 0; count < V-1; count++) { int u = minDistance(dist, sptSet,V); sptSet[u] = true; for (int v = 0; v < V; v++) if (sptSet[v]==false && graph[u][v]>=0 && dist[u] != Integer.MAX_VALUE && dist[u]+graph[u][v] < dist[v]){ dist[v] = dist[u] + graph[u][v]; prev[v]=u;} } System.out.printf("The minimum distance path between %d and %d is: %d",source,destination,dist[destination]); System.out.printf(" the Shorest path is : %d",source); print_path(prev,source,destination,V); } }