CC = E – N + 2 Flowgraph Manajemen Product CC = E – N + 2 Flowgraph Laporan Pemesanan CC = E – N + 2 Flowgraph Pajak dan Biaya CC = E – N + 2 Flowgraph Logout VG = E – N + 2 = 3 – 4 + 2 = 1

Karena CC =7, Region=7, independen path=7, maka manajemen user sudah bebas dari kesalahan logika.

9. Flowgraph Laporan Customer

Gambar 20 : Flowgraph Laporan Customer Node N = 13 Edge E = 16 Region R = 5 9. CC = E – N + 2 = 16 – 13 + 2 = 5 Path 1 = 1-2-3-4-5-6-7-5-6-7-8-13 Path 2 = 1-2-3-4-5-6-7-8-13 Path 3 = 1-2-3-4-9-10-13 Path 4 = 1-2-3-4-9-11-12-13 Path 5 = 1-2-3-4-9-11-13 Karena CC =5, Region=5, independen path=5, maka laporan customer sudah bebas dari kesalahan logika.

10. Flowgraph Manajemen Product

Gambar 21 : Flowgraph Manajemen Product Node N = 18 Edge E = 23 Region R = 7 10. CC = E – N + 2 = 23 – 18 + 2 = 7 Path 1 = 1-2-3-4-5-6-7-5-6-7-8-18 Path 2 = 1-2-3-4-5-6-7-8-18 Path 3 = 1-2-3-4-9-10-11-12-10-11-12-13-18 Path 4 = 1-2-3-4-9-10-11-12-13-18 Path 5 = 1-2-3-4-9-14-15-18 Path 6 = 1-2-3-4-9-14-16-17-18 Path 7 = 1-2-3-4-9-14-16-18 Karena CC =7, Region=7, independen path=7, maka manajemen product sudah bebas dari kesalahan logika.

11. Flowgraph Laporan Pemesanan

Gambar 22 : Flowgraph Laporan Pemesanan Node N = 13 Edge E = 16 Region R = 5 11. CC = E – N + 2 = 16 – 13 + 2 = 5 Path 1 = 1-2-3-4-5-6-7-5-6-7-8-13 Path 2 = 1-2-3-4-5-6-7-8-13 Path 3 = 1-2-3-4-9-10-13 Path 4 = 1-2-3-4-9-11-12-13 Path 5 = 1-2-3-4-9-11-13 Karena CC =5, Region=5, independen path=5, maka laporan pemesanan sudah bebas dari kesalahan logika.

12. Flowgraph Pajak dan Biaya

Gambar 23 : Flowgraph Pajak dan Biaya Node N = 18 Edge E = 23 Region R = 7 12. CC = E – N + 2 = 23 – 18 + 2 = 7 Path 1 = 1-2-3-4-5-6-7-5-6-7-8-18 Path 2 = 1-2-3-4-5-6-7-8-18 Path 3 = 1-2-3-4-9-10-11-12-10-11-12-13-18 Path 4 = 1-2-3-4-9-10-11-12-13-18 Path 5 = 1-2-3-4-9-14-15-18 Path 6 = 1-2-3-4-9-14-16-17-18 Path 7 = 1-2-3-4-9-14-16-18 Karena CC =7, Region=7, independen path=7, maka pajak dan biaya sudah bebas dari kesalahan logika.

13. Flowgraph Logout

Gambar 24 : Flowgraph Logout Node N = 4 Edge E = 3 Region R = 1 13. VG = E – N + 2 = 3 – 4 + 2 = 1 Path 1 = 1-2-3-4 Karena CC =1, Region=1, independen path=1, maka logout sudah bebas dari kesalahan logika.

4.3 Rekapitulasi Hasil Pengujian Perangkat Lunak