user: Translate the below assembly code into C programming language:

```asm
<dijsktra>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x668,%rsp
  mov    %rdi,%r10
  mov    %esi,%r11d
  mov    %edx,%r12d
  mov    %fs:0x28,%rax
  mov    %rax,0x658(%rsp)
  xor    %eax,%eax
  test   %esi,%esi
  jle    L183
  mov    %esi,%edx
L10:
  movl   $0x270f,0x10(%rsp,%rax,4)
  movl   $0xffffffff,0x1a0(%rsp,%rax,4)
  movl   $0x0,0x330(%rsp,%rax,4)
  add    $0x1,%rax
  cmp    %rdx,%rax
  jne    L10
  movslq %r12d,%rax
  movl   $0x0,0x10(%rsp,%rax,4)
  mov    %r12d,0x1a0(%rsp,%rax,4)
L77:
  mov    $0x0,%ebx
  mov    %r11d,%edi
  lea    0x330(%rsp),%r9
  lea    0x10(%rsp),%rcx
  jmp    L242
L183:
  movslq %edx,%rax
  movl   $0x0,0x10(%rsp,%rax,4)
  mov    %edx,0x1a0(%rsp,%rax,4)
  je     L77
L140:
  mov    0x658(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L132
  add    $0x668,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L98:
  add    $0x1,%rax
  cmp    %rdi,%rax
  je     L85
L162:
  mov    (%rcx,%rax,4),%edx
  cmp    %esi,%edx
  jge    L98
  cmpl   $0x0,(%r9,%rax,4)
  cmove  %eax,%r8d
  cmove  %edx,%esi
  jmp    L98
L26:
  add    $0x1,%rax
  cmp    %rdi,%rax
  je     L126
L49:
  mov    (%rsi,%rax,4),%edx
  add    0x10(%rsp,%rbp,4),%edx
  cmp    (%rcx,%rax,4),%edx
  jge    L26
  cmpl   $0x0,(%r9,%rax,4)
  jne    L26
  mov    %edx,(%rcx,%rax,4)
  mov    %r8d,0x1a0(%rsp,%rax,4)
  jmp    L26
L126:
  add    $0x1,%ebx
  cmp    %ebx,%r11d
  jl     L182
L242:
  mov    $0x0,%eax
  mov    $0x0,%r8d
  mov    $0x270f,%esi
  test   %r11d,%r11d
  jg     L162
  movl   $0x1,0x330(%rsp)
  jmp    L126
L182:
  test   %r11d,%r11d
  jle    L140
  mov    %r11d,%eax
  mov    %rax,0x8(%rsp)
  mov    $0x0,%ebp
  lea    D14(%rip),%r14
  lea    D13(%rip),%r15
  jmp    L111
L240:
  mov    $0xa,%edi
  call   <putchar@plt>
L22:
  add    $0x1,%rbp
  cmp    0x8(%rsp),%rbp
  je     L140
L111:
  mov    %ebp,%edx
  cmp    %ebp,%r12d
  je     L22
  mov    0x10(%rsp,%rbp,4),%ecx
  mov    %r12d,%esi
  lea    D27(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    0x4c0(%rsp),%rdi
  mov    $0x32,%ecx
  mov    $0x0,%eax
  rep stos %rax,%es:(%rdi)
  mov    %ebp,0x4c0(%rsp)
  mov    0x1a0(%rsp,%rbp,4),%eax
  cmp    %eax,%r12d
  je     L128
  mov    $0x0,%edx
L226:
  mov    %edx,%ecx
  mov    %eax,0x4c4(%rsp,%rdx,4)
  cltq
  mov    0x1a0(%rsp,%rax,4),%eax
  add    $0x1,%rdx
  cmp    %r12d,%eax
  jne    L226
  add    $0x2,%ecx
  movslq %ecx,%rax
  mov    %r12d,0x4c0(%rsp,%rax,4)
  cmp    $0xffffffff,%ecx
  je     L240
L222:
  movslq %ecx,%rax
  lea    0x4c0(%rsp,%rax,4),%rbx
  mov    %ecx,%ecx
  shl    $0x2,%rcx
  mov    %rbx,%r13
  sub    %rcx,%r13
L194:
  mov    (%rbx),%esi
  mov    %r14,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  cmp    %r13,%rbx
  je     L240
  mov    %r15,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  sub    $0x4,%rbx
  jmp    L194
L128:
  mov    %eax,0x4c4(%rsp)
  mov    $0x1,%ecx
  jmp    L222
L85:
  movslq %r8d,%rax
  movl   $0x1,0x330(%rsp,%rax,4)
  lea    (%rax,%rax,4),%rax
  lea    (%rax,%rax,4),%rsi
  shl    $0x4,%rsi
  add    %r10,%rsi
  mov    $0x0,%eax
  movslq %r8d,%rbp
  jmp    L49
L132:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: retrieve_data
arguments: data_label: D14
datatype: string
name: retrieve_data
arguments: data_label: D13
datatype: string
name: retrieve_data
arguments: data_label: D27
datatype: string

tool: D14: %d 

tool: D13: -> 

tool: D27: Path %d to %d : cost : %d : Path : 

assistant: ```c
void dijsktra(int cost[100][100], int N, int source) {
  int dist[100], predecessor[100], visited[100];
  int i, count;
  for (i = 0; i < N; i++) {
    dist[i] = 9999;
    predecessor[i] = -1;
    visited[i] = 0;
  }
  dist[source] = 0;
  predecessor[source] = source;
  count = 0;
  while (count <= N) {
    int min = 9999, u = 0;
    for (i = 0; i < N; i++) {
      if (dist[i] < min && !visited[i]) {
        min = dist[i];
        u = i;
      }
    }
    visited[u] = 1;
    for (i = 0; i < N; i++) {
      if (dist[u] + cost[u][i] < dist[i] && !visited[i]) {
        dist[i] = dist[u] + cost[u][i];
        predecessor[i] = u;
      }
    }
    count++;
  }
  for (i = 0; i < N; i++) {
    if (i != source) {
      printf("Path %d to %d : cost : %d : Path : ", source, i, dist[i]);
      int path[100] = {0}, top = -1, j = i;
      path[++top] = i;
      while (predecessor[j] != source) {
        j = predecessor[j];
        path[++top] = j;
      }
      path[++top] = source;
      while (top != -1) {
        printf("%d ", path[top--]);
        if (top != -1)
          printf("-> ");
      }
      printf("\n");
    }
  }
}
```