user: 请显示与下面列出的汇编代码相匹配的C语言实现：

```asm
<Dijsktra>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  push   %r13
  push   %r12
  push   %rbx
  sub    $0x58,%rsp
  mov    %rdi,-0x58(%rbp)
  mov    %esi,-0x5c(%rbp)
  mov    %edx,-0x60(%rbp)
  mov    %ecx,-0x64(%rbp)
  mov    %r8,-0x70(%rbp)
  mov    %fs:0x28,%rax
  mov    %rax,-0x28(%rbp)
  xor    %eax,%eax
  mov    %rsp,%rax
  mov    %rax,%rbx
  mov    -0x5c(%rbp),%eax
  movslq %eax,%rdx
  sub    $0x1,%rdx
  mov    %rdx,-0x38(%rbp)
  movslq %eax,%rdx
  mov    %rdx,%r12
  mov    $0x0,%r13d
  movslq %eax,%rdx
  mov    %rdx,%r10
  mov    $0x0,%r11d
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    $0x10,%eax
  sub    $0x1,%rax
  add    %rdx,%rax
  mov    $0x10,%edi
  mov    $0x0,%edx
  div    %rdi
  imul   $0x10,%rax,%rax
  mov    %rax,%rcx
  and    $0xfffffffffffff000,%rcx
  mov    %rsp,%rdx
  sub    %rcx,%rdx
L126:
  cmp    %rdx,%rsp
  je     L2
  sub    $0x1000,%rsp
  orq    $0x0,0xff8(%rsp)
  jmp    L126
L2:
  mov    %rax,%rdx
  and    $0xfff,%edx
  sub    %rdx,%rsp
  mov    %rax,%rdx
  and    $0xfff,%edx
  test   %rdx,%rdx
  je     L35
  and    $0xfff,%eax
  sub    $0x8,%rax
  add    %rsp,%rax
  orq    $0x0,(%rax)
L35:
  mov    %rsp,%rax
  add    $0x3,%rax
  shr    $0x2,%rax
  shl    $0x2,%rax
  mov    %rax,-0x30(%rbp)
  movl   $0x0,-0x4c(%rbp)
  jmp    L108
L136:
  mov    -0x4c(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rax,%rdx
  mov    D26(%rip),%rax
  mov    (%rax),%eax
  mov    %eax,(%rdx)
  mov    -0x30(%rbp),%rax
  mov    -0x4c(%rbp),%edx
  movslq %edx,%rdx
  movl   $0x0,(%rax,%rdx,4)
  addl   $0x1,-0x4c(%rbp)
L108:
  mov    -0x4c(%rbp),%eax
  cmp    -0x5c(%rbp),%eax
  jl     L136
  mov    -0x64(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rdx,%rax
  movl   $0x0,(%rax)
  movl   $0x0,-0x48(%rbp)
  jmp    L122
L115:
  mov    -0x5c(%rbp),%edx
  mov    -0x30(%rbp),%rcx
  mov    -0x70(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <minDistance@plt>
  mov    %eax,-0x40(%rbp)
  mov    -0x30(%rbp),%rax
  mov    -0x40(%rbp),%edx
  movslq %edx,%rdx
  movl   $0x1,(%rax,%rdx,4)
  movl   $0x0,-0x44(%rbp)
  jmp    L133
L120:
  mov    -0x60(%rbp),%ecx
  mov    -0x44(%rbp),%edx
  mov    -0x40(%rbp),%esi
  mov    -0x58(%rbp),%rax
  mov    %rax,%rdi
  call   <askGraph@plt>
  mov    %eax,-0x3c(%rbp)
  mov    -0x30(%rbp),%rax
  mov    -0x44(%rbp),%edx
  movslq %edx,%rdx
  mov    (%rax,%rdx,4),%eax
  test   %eax,%eax
  jne    L29
  mov    -0x40(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%edx
  mov    D26(%rip),%rax
  mov    (%rax),%eax
  cmp    %eax,%edx
  je     L29
  mov    D13(%rip),%rax
  mov    (%rax),%eax
  cmp    %eax,-0x3c(%rbp)
  je     L29
  mov    -0x44(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%eax
  mov    -0x40(%rbp),%edx
  movslq %edx,%rdx
  lea    0x0(,%rdx,4),%rcx
  mov    -0x70(%rbp),%rdx
  add    %rcx,%rdx
  mov    (%rdx),%ecx
  mov    -0x3c(%rbp),%edx
  add    %ecx,%edx
  cmp    %edx,%eax
  jle    L29
  mov    -0x40(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%ecx
  mov    -0x44(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rdx,%rax
  mov    -0x3c(%rbp),%edx
  add    %ecx,%edx
  mov    %edx,(%rax)
L29:
  addl   $0x1,-0x44(%rbp)
L133:
  mov    -0x44(%rbp),%eax
  cmp    -0x5c(%rbp),%eax
  jl     L120
  addl   $0x1,-0x48(%rbp)
L122:
  mov    -0x5c(%rbp),%eax
  sub    $0x1,%eax
  cmp    %eax,-0x48(%rbp)
  jl     L115
  mov    -0x70(%rbp),%rax
  mov    %rbx,%rsp
  mov    -0x28(%rbp),%rdx
  sub    %fs:0x28,%rdx
  je     L19
  call   <__stack_chk_fail@plt>
L19:
  lea    -0x18(%rbp),%rsp
  pop    %rbx
  pop    %r12
  pop    %r13
  pop    %rbp
  ret
```

assistant: ```c
int *Dijsktra(struct Graph *graph, int V, int E, int src, int *dist) {
  bool visited[V];
  for (int i = 0; i < V; i++) {
    dist[i] = INT_MAX;
    visited[i] = false;
  }
  dist[src] = 0;
  for (int i = 0; i < V - 1; i++) {
    int u = minDistance(dist, visited, V);
    visited[u] = true;
    for (int v = 0; v < V; v++) {
      int temp = askGraph(graph, u, v, E);
      if (!visited[v] && dist[u] != INT_MAX && temp != INT_MIN && dist[v] > dist[u] + temp) {
        dist[v] = dist[u] + temp;
      }
    }
  }
  return dist;
}
```