Open Terminal
Anik_Dev_Core
Home
Projects
AI Reviewer
Blog
About
Hire Me
AI Code Reviewer
Analyze your code.
gemini-3-flash-preview
gemini-3.1-flash-lite-preview
gemini-2.5-flash
Review Code
Input.py
import heapq def dijkstra(graph, start): distances = {node: float('infinity') for node in graph} distances[start] = 0 pq = [(0, start)] while pq: current_distance, current_node = heapq.heappop(pq) if current_distance > distances[current_node]: continue for neighbor, weight in graph[current_node].items(): distance = current_distance + weight if distance < distances[neighbor]: distances[neighbor] = distance heapq.heappush(pq, (distance, neighbor)) return distances
AI Analysis Output
🤖
Awaiting code input...
Select a model and hit review to begin.