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

```asm
<Dijsktra>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  push   %r15
  mov    %edx,%r15d
  movslq %esi,%rdx
  push   %r14
  mov    %rdi,%r14
  push   %r13
  push   %r12
  push   %rbx
  movslq %ecx,%rbx
  sub    $0x48,%rsp
  mov    %esi,-0x64(%rbp)
  mov    %r8,-0x58(%rbp)
  mov    %rsp,%rsi
  mov    %fs:0x28,%rax
  mov    %rax,-0x38(%rbp)
  xor    %eax,%eax
  lea    0xf(,%rdx,4),%rax
  mov    %rax,%rcx
  and    $0xfffffffffffff000,%rax
  sub    %rax,%rsi
  and    $0xfffffffffffffff0,%rcx
  cmp    %rsi,%rsp
  je     L98
L172:
  sub    $0x1000,%rsp
  orq    $0x0,0xff8(%rsp)
  cmp    %rsi,%rsp
  jne    L172
L98:
  and    $0xfff,%ecx
  sub    %rcx,%rsp
  test   %rcx,%rcx
  jne    L46
L45:
  mov    -0x64(%rbp),%esi
  mov    %rsp,%r12
  test   %esi,%esi
  jle    L164
  mov    -0x58(%rbp),%rsi
  mov    -0x64(%rbp),%edi
  lea    (%rsi,%rdx,4),%rax
  mov    D13(%rip),%rdx
  lea    -0x1(%rdi),%r10d
  mov    %r10d,-0x60(%rbp)
  cmp    %rdx,%rax
  lea    0x4(%rdx),%rcx
  setbe  %al
  cmp    %rcx,%rsi
  setae  %cl
  or     %cl,%al
  je     L35
  cmp    $0x2,%r10d
  jbe    L35
  mov    %edi,%ecx
  movd   (%rdx),%xmm1
  mov    %rsi,%rax
  shr    $0x2,%ecx
  sub    $0x1,%ecx
  pshufd $0x0,%xmm1,%xmm0
  shl    $0x4,%rcx
  lea    0x10(%rsi,%rcx,1),%rcx
  nopl   (%rax)
L194:
  movups %xmm0,(%rax)
  add    $0x10,%rax
  cmp    %rcx,%rax
  jne    L194
  mov    -0x64(%rbp),%r9d
  mov    %r9d,%eax
  and    $0xfffffffc,%eax
  test   $0x3,%r9b
  je     L220
  mov    (%rdx),%esi
  mov    -0x58(%rbp),%r11
  mov    %eax,%ecx
  lea    0x0(,%rcx,4),%rdi
  mov    %esi,(%r11,%rcx,4)
  lea    0x1(%rax),%ecx
  cmp    %ecx,%r9d
  jle    L220
  add    $0x2,%eax
  mov    %esi,0x4(%r11,%rdi,1)
  cmp    %eax,%r9d
  jle    L220
  mov    (%rdx),%eax
  mov    %eax,0x8(%r11,%rdi,1)
L220:
  mov    -0x64(%rbp),%edx
  xor    %esi,%esi
  mov    %r12,%rdi
  shl    $0x2,%rdx
  call   <memset@plt>
L11:
  mov    -0x58(%rbp),%rax
  mov    -0x60(%rbp),%ecx
  movl   $0x0,(%rax,%rbx,4)
  test   %ecx,%ecx
  jle    L47
  movl   $0x0,-0x5c(%rbp)
  nopw   0x0(%rax,%rax,1)
L141:
  mov    -0x64(%rbp),%r13d
  mov    -0x58(%rbp),%rdi
  mov    %r12,%rsi
  mov    %r13d,%edx
  call   <minDistance@plt>
  mov    %eax,%ebx
  cltq
  movl   $0x1,(%r12,%rax,4)
  test   %r13d,%r13d
  jle    L144
  mov    -0x58(%rbp),%rsi
  xor    %r13d,%r13d
  lea    (%rsi,%rax,4),%rax
  mov    %rax,-0x50(%rbp)
  mov    -0x60(%rbp),%eax
  mov    %rax,-0x48(%rbp)
  jmp    L213
  nopl   0x0(%rax)
L236:
  mov    %rax,%r13
L213:
  mov    %r13d,%edx
  mov    %r15d,%ecx
  mov    %ebx,%esi
  mov    %r14,%rdi
  call   <askGraph@plt>
  mov    (%r12,%r13,4),%edx
  test   %edx,%edx
  jne    L132
  mov    -0x50(%rbp),%rsi
  mov    D13(%rip),%rcx
  mov    (%rsi),%edx
  cmp    (%rcx),%edx
  je     L132
  mov    D12(%rip),%rcx
  cmp    %eax,(%rcx)
  je     L132
  add    %eax,%edx
  mov    -0x58(%rbp),%rax
  cmp    %edx,(%rax,%r13,4)
  jle    L132
  mov    %edx,(%rax,%r13,4)
  nop
L132:
  lea    0x1(%r13),%rax
  cmp    -0x48(%rbp),%r13
  jne    L236
L144:
  addl   $0x1,-0x5c(%rbp)
  mov    -0x5c(%rbp),%eax
  cmp    -0x60(%rbp),%eax
  jne    L141
L47:
  mov    -0x38(%rbp),%rax
  sub    %fs:0x28,%rax
  jne    L80
  mov    -0x58(%rbp),%rax
  lea    -0x28(%rbp),%rsp
  pop    %rbx
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  pop    %rbp
  ret
L46:
  orq    $0x0,-0x8(%rsp,%rcx,1)
  jmp    L45
L35:
  mov    -0x58(%rbp),%rsi
  mov    -0x60(%rbp),%ecx
  mov    %rsi,%rax
  lea    0x4(%rsi,%rcx,4),%rsi
  cs nopw 0x0(%rax,%rax,1)
L49:
  mov    (%rdx),%ecx
  add    $0x4,%rax
  mov    %ecx,-0x4(%rax)
  cmp    %rsi,%rax
  jne    L49
  jmp    L220
L164:
  mov    -0x64(%rbp),%eax
  sub    $0x1,%eax
  mov    %eax,-0x60(%rbp)
  jmp    L11
L80:
  call   <__stack_chk_fail@plt>
```

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;
}
```