	.file	"98574016.c"
	.intel_syntax noprefix
	.text
	.section	.rodata
.LC0:
	.string	"Enter the number of nodes: "
.LC1:
	.string	"%d"
	.align 8
.LC2:
	.string	"Enter the cost adjacency matrix:"
.LC3:
	.string	"Enter the source node: "
	.align 8
.LC4:
	.string	"Minimum Spanning Tree does not exist!"
	.align 8
.LC5:
	.string	"Cost of Minimum Spanning Tree is %d!"
	.text
	.globl	main
	.type	main, @function
main:
.LFB0:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 448
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	lea	rdi, .LC0[rip]
	mov	eax, 0
	call	printf@PLT
	lea	rax, -436[rbp]
	mov	rsi, rax
	lea	rdi, .LC1[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	lea	rdi, .LC2[rip]
	call	puts@PLT
	mov	DWORD PTR -428[rbp], 1
	jmp	.L2
.L5:
	mov	DWORD PTR -424[rbp], 1
	jmp	.L3
.L4:
	lea	rcx, -416[rbp]
	mov	eax, DWORD PTR -424[rbp]
	movsx	rsi, eax
	mov	eax, DWORD PTR -428[rbp]
	movsx	rdx, eax
	mov	rax, rdx
	sal	rax, 2
	add	rax, rdx
	add	rax, rax
	add	rax, rsi
	sal	rax, 2
	add	rax, rcx
	mov	rsi, rax
	lea	rdi, .LC1[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	add	DWORD PTR -424[rbp], 1
.L3:
	mov	eax, DWORD PTR -436[rbp]
	cmp	DWORD PTR -424[rbp], eax
	jle	.L4
	add	DWORD PTR -428[rbp], 1
.L2:
	mov	eax, DWORD PTR -436[rbp]
	cmp	DWORD PTR -428[rbp], eax
	jle	.L5
	lea	rdi, .LC3[rip]
	mov	eax, 0
	call	printf@PLT
	lea	rax, -432[rbp]
	mov	rsi, rax
	lea	rdi, .LC1[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	mov	edx, DWORD PTR -432[rbp]
	mov	ecx, DWORD PTR -436[rbp]
	lea	rax, -416[rbp]
	mov	esi, ecx
	mov	rdi, rax
	call	primsAlgorithm
	mov	DWORD PTR -420[rbp], eax
	cmp	DWORD PTR -420[rbp], 999
	jne	.L6
	lea	rdi, .LC4[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L7
.L6:
	mov	eax, DWORD PTR -420[rbp]
	mov	esi, eax
	lea	rdi, .LC5[rip]
	mov	eax, 0
	call	printf@PLT
.L7:
	mov	eax, 0
	mov	rcx, QWORD PTR -8[rbp]
	sub	rcx, QWORD PTR fs:40
	je	.L9
	call	__stack_chk_fail@PLT
.L9:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE0:
	.size	main, .-main
	.globl	primsAlgorithm
	.type	primsAlgorithm, @function
primsAlgorithm:
.LFB1:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 144
	mov	QWORD PTR -136[rbp], rdi
	mov	DWORD PTR -140[rbp], esi
	mov	DWORD PTR -144[rbp], edx
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	mov	DWORD PTR -100[rbp], 0
	mov	DWORD PTR -120[rbp], 1
	jmp	.L11
.L12:
	mov	eax, DWORD PTR -144[rbp]
	movsx	rdx, eax
	mov	rax, rdx
	sal	rax, 2
	add	rax, rdx
	sal	rax, 3
	mov	rdx, rax
	mov	rax, QWORD PTR -136[rbp]
	add	rdx, rax
	mov	eax, DWORD PTR -120[rbp]
	cdqe
	mov	edx, DWORD PTR [rdx+rax*4]
	mov	eax, DWORD PTR -120[rbp]
	cdqe
	mov	DWORD PTR -48[rbp+rax*4], edx
	mov	eax, DWORD PTR -120[rbp]
	cdqe
	mov	DWORD PTR -96[rbp+rax*4], 0
	add	DWORD PTR -120[rbp], 1
.L11:
	mov	eax, DWORD PTR -120[rbp]
	cmp	eax, DWORD PTR -140[rbp]
	jle	.L12
	mov	eax, DWORD PTR -144[rbp]
	cdqe
	mov	DWORD PTR -96[rbp+rax*4], 1
	mov	DWORD PTR -120[rbp], 1
	jmp	.L13
.L20:
	mov	DWORD PTR -112[rbp], 999
	mov	DWORD PTR -116[rbp], 1
	jmp	.L14
.L16:
	mov	eax, DWORD PTR -116[rbp]
	cdqe
	mov	eax, DWORD PTR -96[rbp+rax*4]
	test	eax, eax
	jne	.L15
	mov	eax, DWORD PTR -116[rbp]
	cdqe
	mov	eax, DWORD PTR -48[rbp+rax*4]
	cmp	DWORD PTR -112[rbp], eax
	jle	.L15
	mov	eax, DWORD PTR -116[rbp]
	cdqe
	mov	eax, DWORD PTR -48[rbp+rax*4]
	mov	DWORD PTR -112[rbp], eax
	mov	eax, DWORD PTR -116[rbp]
	mov	DWORD PTR -108[rbp], eax
.L15:
	add	DWORD PTR -116[rbp], 1
.L14:
	mov	eax, DWORD PTR -116[rbp]
	cmp	eax, DWORD PTR -140[rbp]
	jle	.L16
	mov	eax, DWORD PTR -108[rbp]
	cdqe
	mov	DWORD PTR -96[rbp+rax*4], 1
	mov	eax, DWORD PTR -108[rbp]
	cdqe
	mov	eax, DWORD PTR -48[rbp+rax*4]
	add	DWORD PTR -100[rbp], eax
	mov	DWORD PTR -104[rbp], 1
	jmp	.L17
.L19:
	mov	eax, DWORD PTR -104[rbp]
	cdqe
	mov	eax, DWORD PTR -96[rbp+rax*4]
	test	eax, eax
	jne	.L18
	mov	eax, DWORD PTR -104[rbp]
	cdqe
	mov	ecx, DWORD PTR -48[rbp+rax*4]
	mov	eax, DWORD PTR -108[rbp]
	movsx	rdx, eax
	mov	rax, rdx
	sal	rax, 2
	add	rax, rdx
	sal	rax, 3
	mov	rdx, rax
	mov	rax, QWORD PTR -136[rbp]
	add	rdx, rax
	mov	eax, DWORD PTR -104[rbp]
	cdqe
	mov	eax, DWORD PTR [rdx+rax*4]
	cmp	ecx, eax
	jle	.L18
	mov	eax, DWORD PTR -108[rbp]
	movsx	rdx, eax
	mov	rax, rdx
	sal	rax, 2
	add	rax, rdx
	sal	rax, 3
	mov	rdx, rax
	mov	rax, QWORD PTR -136[rbp]
	add	rdx, rax
	mov	eax, DWORD PTR -104[rbp]
	cdqe
	mov	edx, DWORD PTR [rdx+rax*4]
	mov	eax, DWORD PTR -104[rbp]
	cdqe
	mov	DWORD PTR -48[rbp+rax*4], edx
.L18:
	add	DWORD PTR -104[rbp], 1
.L17:
	mov	eax, DWORD PTR -104[rbp]
	cmp	eax, DWORD PTR -140[rbp]
	jle	.L19
	add	DWORD PTR -120[rbp], 1
.L13:
	mov	eax, DWORD PTR -120[rbp]
	cmp	eax, DWORD PTR -140[rbp]
	jl	.L20
	mov	eax, DWORD PTR -100[rbp]
	mov	rsi, QWORD PTR -8[rbp]
	sub	rsi, QWORD PTR fs:40
	je	.L22
	call	__stack_chk_fail@PLT
.L22:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE1:
	.size	primsAlgorithm, .-primsAlgorithm
	.ident	"GCC: (Ubuntu 10.5.0-1ubuntu1~20.04) 10.5.0"
	.section	.note.GNU-stack,"",@progbits
	.section	.note.gnu.property,"a"
	.align 8
	.long	 1f - 0f
	.long	 4f - 1f
	.long	 5
0:
	.string	 "GNU"
1:
	.align 8
	.long	 0xc0000002
	.long	 3f - 2f
2:
	.long	 0x3
3:
	.align 8
4:

	.arch armv5t
	.eabi_attribute 20, 1
	.eabi_attribute 21, 1
	.eabi_attribute 23, 3
	.eabi_attribute 24, 1
	.eabi_attribute 25, 1
	.eabi_attribute 26, 2
	.eabi_attribute 30, 6
	.eabi_attribute 34, 0
	.eabi_attribute 18, 4
	.file	"98574016.c"
	.text
	.section	.rodata
	.align	2
.LC0:
	.ascii	"Enter the number of nodes: \000"
	.align	2
.LC1:
	.ascii	"%d\000"
	.align	2
.LC2:
	.ascii	"Enter the cost adjacency matrix:\000"
	.align	2
.LC3:
	.ascii	"Enter the source node: \000"
	.align	2
.LC4:
	.ascii	"Minimum Spanning Tree does not exist!\000"
	.align	2
.LC5:
	.ascii	"Cost of Minimum Spanning Tree is %d!\000"
	.align	2
.LC6:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	main
	.syntax unified
	.arm
	.fpu softvfp
	.type	main, %function
main:
	@ args = 0, pretend = 0, frame = 424
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #424
	ldr	r3, .L10
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	ldr	r0, .L10+4
	bl	printf
	sub	r3, fp, #428
	mov	r1, r3
	ldr	r0, .L10+8
	bl	__isoc99_scanf
	ldr	r0, .L10+12
	bl	puts
	mov	r3, #1
	str	r3, [fp, #-420]
	b	.L2
.L5:
	mov	r3, #1
	str	r3, [fp, #-416]
	b	.L3
.L4:
	sub	r1, fp, #408
	ldr	r2, [fp, #-420]
	mov	r3, r2
	lsl	r3, r3, #2
	add	r3, r3, r2
	lsl	r3, r3, #1
	ldr	r2, [fp, #-416]
	add	r3, r3, r2
	lsl	r3, r3, #2
	add	r3, r1, r3
	mov	r1, r3
	ldr	r0, .L10+8
	bl	__isoc99_scanf
	ldr	r3, [fp, #-416]
	add	r3, r3, #1
	str	r3, [fp, #-416]
.L3:
	ldr	r3, [fp, #-428]
	ldr	r2, [fp, #-416]
	cmp	r2, r3
	ble	.L4
	ldr	r3, [fp, #-420]
	add	r3, r3, #1
	str	r3, [fp, #-420]
.L2:
	ldr	r3, [fp, #-428]
	ldr	r2, [fp, #-420]
	cmp	r2, r3
	ble	.L5
	ldr	r0, .L10+16
	bl	printf
	sub	r3, fp, #424
	mov	r1, r3
	ldr	r0, .L10+8
	bl	__isoc99_scanf
	ldr	r1, [fp, #-428]
	ldr	r2, [fp, #-424]
	sub	r3, fp, #408
	mov	r0, r3
	bl	primsAlgorithm
	str	r0, [fp, #-412]
	ldr	r3, [fp, #-412]
	ldr	r2, .L10+20
	cmp	r3, r2
	bne	.L6
	ldr	r0, .L10+24
	bl	printf
	b	.L7
.L6:
	ldr	r1, [fp, #-412]
	ldr	r0, .L10+28
	bl	printf
.L7:
	mov	r3, #0
	ldr	r2, .L10
	ldr	r1, [r2]
	ldr	r2, [fp, #-8]
	eors	r1, r2, r1
	mov	r2, #0
	beq	.L9
	bl	__stack_chk_fail
.L9:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L11:
	.align	2
.L10:
	.word	.LC6
	.word	.LC0
	.word	.LC1
	.word	.LC2
	.word	.LC3
	.word	999
	.word	.LC4
	.word	.LC5
	.size	main, .-main
	.section	.rodata
	.align	2
.LC7:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	primsAlgorithm
	.syntax unified
	.arm
	.fpu softvfp
	.type	primsAlgorithm, %function
primsAlgorithm:
	@ args = 0, pretend = 0, frame = 128
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #128
	str	r0, [fp, #-120]
	str	r1, [fp, #-124]
	str	r2, [fp, #-128]
	ldr	r3, .L25
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	mov	r3, #0
	str	r3, [fp, #-92]
	mov	r3, #1
	str	r3, [fp, #-112]
	b	.L13
.L14:
	ldr	r2, [fp, #-128]
	mov	r3, r2
	lsl	r3, r3, #2
	add	r3, r3, r2
	lsl	r3, r3, #3
	mov	r2, r3
	ldr	r3, [fp, #-120]
	add	r3, r3, r2
	ldr	r2, [fp, #-112]
	ldr	r2, [r3, r2, lsl #2]
	ldr	r3, [fp, #-112]
	lsl	r3, r3, #2
	sub	r1, fp, #4
	add	r3, r1, r3
	str	r2, [r3, #-44]
	ldr	r3, [fp, #-112]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	mov	r2, #0
	str	r2, [r3, #-84]
	ldr	r3, [fp, #-112]
	add	r3, r3, #1
	str	r3, [fp, #-112]
.L13:
	ldr	r2, [fp, #-112]
	ldr	r3, [fp, #-124]
	cmp	r2, r3
	ble	.L14
	ldr	r3, [fp, #-128]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	mov	r2, #1
	str	r2, [r3, #-84]
	mov	r3, #1
	str	r3, [fp, #-112]
	b	.L15
.L22:
	ldr	r3, .L25+4
	str	r3, [fp, #-104]
	mov	r3, #1
	str	r3, [fp, #-108]
	b	.L16
.L18:
	ldr	r3, [fp, #-108]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	ldr	r3, [r3, #-84]
	cmp	r3, #0
	bne	.L17
	ldr	r3, [fp, #-108]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	ldr	r3, [r3, #-44]
	ldr	r2, [fp, #-104]
	cmp	r2, r3
	ble	.L17
	ldr	r3, [fp, #-108]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	ldr	r3, [r3, #-44]
	str	r3, [fp, #-104]
	ldr	r3, [fp, #-108]
	str	r3, [fp, #-100]
.L17:
	ldr	r3, [fp, #-108]
	add	r3, r3, #1
	str	r3, [fp, #-108]
.L16:
	ldr	r2, [fp, #-108]
	ldr	r3, [fp, #-124]
	cmp	r2, r3
	ble	.L18
	ldr	r3, [fp, #-100]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	mov	r2, #1
	str	r2, [r3, #-84]
	ldr	r3, [fp, #-100]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	ldr	r3, [r3, #-44]
	ldr	r2, [fp, #-92]
	add	r3, r2, r3
	str	r3, [fp, #-92]
	mov	r3, #1
	str	r3, [fp, #-96]
	b	.L19
.L21:
	ldr	r3, [fp, #-96]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	ldr	r3, [r3, #-84]
	cmp	r3, #0
	bne	.L20
	ldr	r3, [fp, #-96]
	lsl	r3, r3, #2
	sub	r2, fp, #4
	add	r3, r2, r3
	ldr	r1, [r3, #-44]
	ldr	r2, [fp, #-100]
	mov	r3, r2
	lsl	r3, r3, #2
	add	r3, r3, r2
	lsl	r3, r3, #3
	mov	r2, r3
	ldr	r3, [fp, #-120]
	add	r3, r3, r2
	ldr	r2, [fp, #-96]
	ldr	r3, [r3, r2, lsl #2]
	cmp	r1, r3
	ble	.L20
	ldr	r2, [fp, #-100]
	mov	r3, r2
	lsl	r3, r3, #2
	add	r3, r3, r2
	lsl	r3, r3, #3
	mov	r2, r3
	ldr	r3, [fp, #-120]
	add	r3, r3, r2
	ldr	r2, [fp, #-96]
	ldr	r2, [r3, r2, lsl #2]
	ldr	r3, [fp, #-96]
	lsl	r3, r3, #2
	sub	r1, fp, #4
	add	r3, r1, r3
	str	r2, [r3, #-44]
.L20:
	ldr	r3, [fp, #-96]
	add	r3, r3, #1
	str	r3, [fp, #-96]
.L19:
	ldr	r2, [fp, #-96]
	ldr	r3, [fp, #-124]
	cmp	r2, r3
	ble	.L21
	ldr	r3, [fp, #-112]
	add	r3, r3, #1
	str	r3, [fp, #-112]
.L15:
	ldr	r2, [fp, #-112]
	ldr	r3, [fp, #-124]
	cmp	r2, r3
	blt	.L22
	ldr	r3, [fp, #-92]
	ldr	r2, .L25
	ldr	r1, [r2]
	ldr	r2, [fp, #-8]
	eors	r1, r2, r1
	mov	r2, #0
	beq	.L24
	bl	__stack_chk_fail
.L24:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L26:
	.align	2
.L25:
	.word	.LC7
	.word	999
	.size	primsAlgorithm, .-primsAlgorithm
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
