import numpy as np
import pandas as pd
import networkx as nx
import matplotlib.pyplot as plt
import seaborn as sns
import string
import os
from collections import defaultdict

INDEX=30

# ==================== HELPER FUNCTIONS ====================
def generate_two_letter_labels(n):
    labels = []
    for i in range(n):
        first = i // 26
        second = i % 26
        label = string.ascii_uppercase[first] + string.ascii_uppercase[second]
        labels.append(label)
    return labels

# ==================== KRUSKAL ALGORITHM ====================
class UnionFind:
    def __init__(self, n):
        self.parent = list(range(n))
        self.rank = [0] * n
    
    def find(self, x):
        if self.parent[x] != x:
            self.parent[x] = self.find(self.parent[x])
        return self.parent[x]
    
    def union(self, x, y):
        px, py = self.find(x), self.find(y)
        if px == py:
            return False
        if self.rank[px] < self.rank[py]:
            px, py = py, px
        self.parent[py] = px
        if self.rank[px] == self.rank[py]:
            self.rank[px] += 1
        return True

def kruskal_mst(dist_matrix):
    n = len(dist_matrix)
    edges = []
    for i in range(n):
        for j in range(i+1, n):
            edges.append((dist_matrix[i][j], i, j))
    edges.sort()
    
    uf = UnionFind(n)
    mst_edges = []
    total_weight = 0
    
    for weight, u, v in edges:
        if uf.union(u, v):
            mst_edges.append((u, v))
            total_weight += weight
            if len(mst_edges) == n - 1:
                break
    
    return total_weight, mst_edges

# ==================== ACO BASE CLASS ====================
class ACO:
    def __init__(self, dist_matrix, n_ants=10, n_iterations=100, alpha=1, beta=2, rho=0.5):
        self.dist_matrix = dist_matrix
        self.n_nodes = len(dist_matrix)
        self.n_ants = n_ants
        self.n_iterations = n_iterations
        self.alpha = alpha
        self.beta = beta
        self.rho = rho
        self.pheromone = np.ones((self.n_nodes, self.n_nodes))
        
    def _select_next_node(self, current, unvisited, max_degree=None, degrees=None):
        pheromone = self.pheromone[current, unvisited]
        heuristic = 1.0 / (self.dist_matrix[current, unvisited] + 1e-10)
        
        if max_degree is not None and degrees is not None:
            valid_mask = np.array([degrees[node] < max_degree for node in unvisited])
            if not np.any(valid_mask):
                return None
            pheromone = pheromone * valid_mask
            heuristic = heuristic * valid_mask
        
        probabilities = (pheromone ** self.alpha) * (heuristic ** self.beta)
        prob_sum = probabilities.sum()
        if prob_sum > 0:
            probabilities = probabilities / prob_sum
        else:
            return None
        
        return np.random.choice(unvisited, p=probabilities)
    
    def _update_pheromone(self, solutions, costs):
        self.pheromone *= (1 - self.rho)
        for solution, cost in zip(solutions, costs):
            for i, j in solution:
                self.pheromone[i][j] += 1.0 / cost
                self.pheromone[j][i] += 1.0 / cost

# ==================== ACO TSP PATH (FAIR - NO CYCLE) ====================
class ACO_TSP_Path(ACO):
    """TSP Hamiltonian Path - TIDAK kembali ke awal (n-1 edges) - FAIR"""
    
    def construct_solution(self, max_degree=None):
        start = np.random.randint(self.n_nodes)
        tour = [start]
        unvisited = list(range(self.n_nodes))
        unvisited.remove(start)
        
        degrees = defaultdict(int) if max_degree else None
        if max_degree:
            degrees[start] = 0
        
        while unvisited:
            current = tour[-1]
            next_node = self._select_next_node(current, unvisited, max_degree, degrees)
            
            if next_node is None:
                return None, float('inf')
            
            tour.append(next_node)
            unvisited.remove(next_node)
            
            if max_degree:
                degrees[current] += 1
                degrees[next_node] += 1
        
        # TIDAK kembali ke awal (PATH - FAIR COMPARISON)
        edges = [(tour[i], tour[i+1]) for i in range(len(tour)-1)]
        cost = sum(self.dist_matrix[i][j] for i, j in edges)
        
        return edges, cost
    
    def run(self, max_degree=None):
        best_cost = float('inf')
        best_solution = None
        
        for iteration in range(self.n_iterations):
            solutions = []
            costs = []
            
            for ant in range(self.n_ants):
                solution, cost = self.construct_solution(max_degree)
                if solution is not None:
                    solutions.append(solution)
                    costs.append(cost)
                    if cost < best_cost:
                        best_cost = cost
                        best_solution = solution
            
            if solutions:
                self._update_pheromone(solutions, costs)
        
        return best_cost, best_solution

# ==================== ACO MST ====================
class ACO_MST(ACO):
    def construct_solution(self, max_degree=None):
        start = np.random.randint(self.n_nodes)
        in_tree = {start}
        edges = []
        degrees = defaultdict(int) if max_degree else None
        
        while len(in_tree) < self.n_nodes:
            candidates = []
            for node in in_tree:
                if max_degree and degrees[node] >= max_degree:
                    continue
                for next_node in range(self.n_nodes):
                    if next_node not in in_tree:
                        if max_degree is None or degrees[next_node] < max_degree:
                            candidates.append((node, next_node))
            
            if not candidates:
                return None, float('inf')
            
            probs = []
            for i, j in candidates:
                pheromone = self.pheromone[i][j]
                heuristic = 1.0 / (self.dist_matrix[i][j] + 1e-10)
                prob = (pheromone ** self.alpha) * (heuristic ** self.beta)
                probs.append(prob)
            
            probs = np.array(probs)
            probs = probs / probs.sum()
            
            selected_idx = np.random.choice(len(candidates), p=probs)
            selected_edge = candidates[selected_idx]
            
            edges.append(selected_edge)
            in_tree.add(selected_edge[1])
            
            if max_degree:
                degrees[selected_edge[0]] += 1
                degrees[selected_edge[1]] += 1
        
        cost = sum(self.dist_matrix[i][j] for i, j in edges)
        return edges, cost
    
    def run(self, max_degree=None):
        best_cost = float('inf')
        best_solution = None
        
        for iteration in range(self.n_iterations):
            solutions = []
            costs = []
            
            for ant in range(self.n_ants):
                solution, cost = self.construct_solution(max_degree)
                if solution is not None:
                    solutions.append(solution)
                    costs.append(cost)
                    if cost < best_cost:
                        best_cost = cost
                        best_solution = solution
            
            if solutions:
                self._update_pheromone(solutions, costs)
        
        return best_cost, best_solution

# ==================== VISUALIZATION ====================
def visualize_solution(dist_matrix, edges, node_labels, title, save_path=None):
    """Visualize graph solution"""
    G = nx.Graph()
    
    # Add all nodes
    for i, label in enumerate(node_labels):
        G.add_node(label)
    
    # Add solution edges
    for i, j in edges:
        u = node_labels[i]
        v = node_labels[j]
        weight = dist_matrix[i][j]
        G.add_edge(u, v, weight=weight)
    
    plt.figure(figsize=(12, 10))
    pos = nx.spring_layout(G, seed=42, k=2)
    
    # Draw nodes
    nx.draw_networkx_nodes(G, pos, node_color='lightblue', 
                           node_size=800, alpha=0.9)
    
    # Draw edges
    nx.draw_networkx_edges(G, pos, width=3, alpha=0.6, edge_color='darkblue')
    
    # Draw labels
    nx.draw_networkx_labels(G, pos, font_size=10, font_weight='bold')
    
    # Draw edge weights
    edge_labels = {(u, v): f'{data["weight"]:.0f}' for u, v, data in G.edges(data=True)}
    nx.draw_networkx_edge_labels(G, pos, edge_labels, font_size=8)
    
    plt.title(title, fontsize=16, fontweight='bold', pad=20)
    plt.axis('off')
    plt.tight_layout()
    
    if save_path:
        plt.savefig(save_path, dpi=150, bbox_inches='tight')
    plt.show()

# ==================== LOAD DATASET ====================
def load_datasets_from_csv(num_vertices=10, datasetKolomMax=31, folder_name='results'):
    if not os.path.exists(folder_name):
        os.makedirs(folder_name)
    
    NF = f'datasetNorm/dataset{num_vertices}_ideal.csv'
    print(f"Loading file: {NF}")
    
    try:
        # PERBAIKAN: Gunakan delimiter semicolon dan strip whitespace dari header
        df = pd.read_csv(NF, delimiter=';')
        df.columns = df.columns.str.strip()  # Hapus whitespace dari nama kolom
        
        print(f"Loaded CSV with {len(df)} rows and {len(df.columns)} columns")
        print(f"Columns: {df.columns.tolist()}")
        
        expected_edges = num_vertices * (num_vertices - 1) // 2
        print(f"Expected edges for {num_vertices} vertices: {expected_edges}")
        
        datasets = []
        
        for ii in range(1, datasetKolomMax):
            COL = f'NamaFile{ii}'
            
            if COL not in df.columns:
                print(f"Column {COL} not found, stopping at {ii-1} datasets")
                break
            
            weights = df[COL].tolist()
            
            if len(weights) < expected_edges:
                print(f"Not enough weights in {COL}: {len(weights)} < {expected_edges}")
                break
            
            # Create complete graph
            G = nx.complete_graph(num_vertices)
            
            for i, (u, v) in enumerate(G.edges()):
                if i < len(weights):  # Safety check
                    G[u][v]['weight'] = weights[i]
            
            # Generate node labels
            if num_vertices <= 20:
                node_labels = [letter for letter in string.ascii_uppercase[:num_vertices]]
            else:
                node_labels = generate_two_letter_labels(num_vertices)
            
            G = nx.relabel_nodes(G, {i: node_labels[i] for i in range(num_vertices)})
            
            # Convert to distance matrix
            nodes = sorted(G.nodes())
            n = len(nodes)
            node_to_idx = {node: idx for idx, node in enumerate(nodes)}
            dist_matrix = np.zeros((n, n))
            
            for u, v, data in G.edges(data=True):
                i = node_to_idx[u]
                j = node_to_idx[v]
                weight = data['weight']
                dist_matrix[i][j] = weight
                dist_matrix[j][i] = weight
            
            datasets.append((dist_matrix, node_labels, G))
        
        print(f"Successfully loaded {len(datasets)} datasets")
        return datasets
    
    except FileNotFoundError:
        print(f"File not found: {NF}")
        print(f"Creating sample dataset...")
        os.makedirs('datasetNorm', exist_ok=True)
        
        n_edges = num_vertices * (num_vertices - 1) // 2
        data = {f'NamaFile{i}': np.random.randint(10, 100, size=n_edges) 
                for i in range(1, min(datasetKolomMax, 11))}
        df_new = pd.DataFrame(data)
        df_new.insert(0, 'Nomor', range(1, n_edges + 1))
        
        # PERBAIKAN: Simpan dengan delimiter semicolon
        df_new.to_csv(NF, index=False, sep=';')
        
        return load_datasets_from_csv(num_vertices, datasetKolomMax, folder_name)
    
    except Exception as e:
        print(f"Error loading datasets: {e}")
        import traceback
        traceback.print_exc()
        return []

# ==================== MAIN EXECUTION ====================
if __name__ == "__main__":
    print("="*80)
    print("FAIR ACO COMPARISON: TSP PATH vs MST (SAME n-1 EDGES)")
    print("="*80)
    
    # Configuration
    num_vertices = INDEX
    datasetKolomMax = 31
    folder_name = 'results'
    
    # Load datasets
    print("\nLoading datasets from CSV...")
    datasets = load_datasets_from_csv(num_vertices, datasetKolomMax, folder_name)
    
    if not datasets:
        print("Error loading datasetsx!")
        exit(1)
    
    print(f"Loaded {len(datasets)} datasets with {num_vertices} vertices each")
    
    # Initialize results
    results = {
        'Dataset': [],
        'Kruskal': [],
        'ACO_TSP_Path_Same': [],
        'ACO_TSP_Path_Tuned': [],
        'ACO_MST_Same': [],
        'ACO_MST_Tuned': [],
        'ACO_TSP_Path_Deg3_Same': [],
        'ACO_TSP_Path_Deg3_Tuned': [],
        'ACO_MST_Deg3_Same': [],
        'ACO_MST_Deg3_Tuned': []
    }
    
    # Store first dataset solutions for visualization
    first_solutions = {}
    
    print("\n" + "="*80)
    print("RUNNING EXPERIMENTS...")
    print("="*80)
    
    for idx, (dist_matrix, node_labels, G_complete) in enumerate(datasets):
        print(f"\nDataset {idx+1}:")
        results['Dataset'].append(f"D{idx+1}")
        
        # Kruskal
        kruskal_cost, kruskal_edges = kruskal_mst(dist_matrix)
        results['Kruskal'].append(kruskal_cost)
        print(f"  Kruskal MST: {kruskal_cost:.2f} ({len(kruskal_edges)} edges)")
        
        if idx == 0:
            first_solutions['kruskal'] = (kruskal_edges, kruskal_cost)
        
        # ACO TSP Path Same (β=2, ρ=0.5)
        aco_tsp_same = ACO_TSP_Path(dist_matrix, beta=2, rho=0.5)
        cost, edges = aco_tsp_same.run()
        results['ACO_TSP_Path_Same'].append(cost)
        print(f"  ACO TSP Path Same: {cost:.2f} ({len(edges) if edges else 0} edges)")
        
        if idx == 0 and edges:
            first_solutions['tsp_same'] = (edges, cost)
        
        # ACO TSP Path Tuned (β=2, ρ=0.3)
        aco_tsp_tuned = ACO_TSP_Path(dist_matrix, beta=2, rho=0.3)
        cost, edges = aco_tsp_tuned.run()
        results['ACO_TSP_Path_Tuned'].append(cost)
        print(f"  ACO TSP Path Tuned: {cost:.2f} ({len(edges) if edges else 0} edges)")
        
        # ACO MST Same
        aco_mst_same = ACO_MST(dist_matrix, beta=2, rho=0.5)
        cost, edges = aco_mst_same.run()
        results['ACO_MST_Same'].append(cost)
        print(f"  ACO MST Same: {cost:.2f} ({len(edges) if edges else 0} edges)")
        
        if idx == 0 and edges:
            first_solutions['mst_same'] = (edges, cost)
        
        # ACO MST Tuned
        aco_mst_tuned = ACO_MST(dist_matrix, beta=1, rho=0.1)
        cost, edges = aco_mst_tuned.run()
        results['ACO_MST_Tuned'].append(cost)
        print(f"  ACO MST Tuned: {cost:.2f} ({len(edges) if edges else 0} edges)")
        
        # With Degree=3 constraints
        for name, aco_class, params in [
            ('TSP_Path_Deg3_Same', ACO_TSP_Path, {'beta': 2, 'rho': 0.5}),
            ('TSP_Path_Deg3_Tuned', ACO_TSP_Path, {'beta': 2, 'rho': 0.3}),
            ('MST_Deg3_Same', ACO_MST, {'beta': 2, 'rho': 0.5}),
            ('MST_Deg3_Tuned', ACO_MST, {'beta': 1, 'rho': 0.1})
        ]:
            aco = aco_class(dist_matrix, **params)
            cost, edges = aco.run(max_degree=3)
            
            if cost == float('inf'):
                for _ in range(5):
                    cost, edges = aco.run(max_degree=3)
                    if cost != float('inf'):
                        break
            
            results[f'ACO_{name}'].append(cost if cost != float('inf') else None)
            edge_count = len(edges) if edges and cost != float('inf') else 0
            print(f"  ACO {name}: {cost:.2f} ({edge_count} edges)" if cost != float('inf') else f"  ACO {name}: No solution")
    
    # Create DataFrame
    df = pd.DataFrame(results)
    
    print("\n" + "="*80)
    print("RESULTS TABLE")
    print("="*80)
    print(df.to_string(index=False))
    
    # Summary statistics
    print("\n" + "="*80)
    print("SUMMARY STATISTICS")
    print("="*80)
    
    def calc_stats(values):
        clean_values = [v for v in values if v is not None and v != float('inf')]
        if not clean_values:
            return None, None, None, None
        return (np.mean(clean_values), np.std(clean_values), min(clean_values), max(clean_values))
    
    summary_data = []
    for col in df.columns:
        if col != 'Dataset':
            mean, std, min_val, max_val = calc_stats(df[col])
            summary_data.append({
                'Algorithm': col,
                'Mean': mean,
                'Std': std,
                'Min': min_val,
                'Max': max_val
            })
    
    summary = pd.DataFrame(summary_data)
    print(summary.to_string(index=False))
    
    # FAIR COMPARISON ANALYSIS
    print("\n" + "="*80)
    print("✅ FAIR COMPARISON ANALYSIS (n-1 edges)")
    print("="*80)
    
    kruskal_mean = summary.iloc[0]['Mean']
    tsp_path_same_mean = summary.iloc[1]['Mean']
    mst_same_mean = summary.iloc[3]['Mean']
    
    print(f"\nEdge Count: n-1 = {num_vertices - 1} edges")
    print(f"\n1. Kruskal (Optimal): {kruskal_mean:.2f}")
    print(f"2. ACO TSP Path:      {tsp_path_same_mean:.2f}")
    print(f"3. ACO MST:           {mst_same_mean:.2f}")
    
    tsp_gap = ((tsp_path_same_mean / kruskal_mean) - 1) * 100
    mst_gap = ((mst_same_mean / kruskal_mean) - 1) * 100
    
    print(f"\nGap from Optimal:")
    print(f"  TSP Path vs Kruskal: {tsp_gap:+.2f}%")
    print(f"  MST vs Kruskal:      {mst_gap:+.2f}%")
    
    print(f"\n✅ Fair comparison karena:")
    print(f"  • Same edge count: {num_vertices - 1} edges")
    print(f"  • No cycle: TSP Path & MST both are paths/trees")
    print(f"  • Apple-to-apple: Both connect all nodes without cycle")
    
    # VISUALIZE FIRST DATASET
    print("\n" + "="*80)
    print("VISUALIZING FIRST DATASET RESULTS")
    print("="*80)
    
    dist_matrix_1, node_labels_1, G_complete_1 = datasets[0]
    
    # Visualize Complete Graph
    print("\n1. Visualizing Complete Graph...")
    plt.figure(figsize=(12, 10))
    pos = nx.spring_layout(G_complete_1, seed=42, k=2)
    nx.draw_networkx_nodes(G_complete_1, pos, node_color='lightgray', node_size=800, alpha=0.6)
    nx.draw_networkx_edges(G_complete_1, pos, width=1, alpha=0.2, edge_color='gray')
    nx.draw_networkx_labels(G_complete_1, pos, font_size=10, font_weight='bold')
    edge_labels = {(u, v): f'{data["weight"]:.0f}' for u, v, data in G_complete_1.edges(data=True) if data['weight'] < 50}
    nx.draw_networkx_edge_labels(G_complete_1, pos, edge_labels, font_size=7)
    plt.title('Complete Graph - Dataset 1 (All Edges)', fontsize=16, fontweight='bold', pad=20)
    plt.axis('off')
    plt.tight_layout()
    plt.savefig(f'{folder_name}/complete_graph.png', dpi=150, bbox_inches='tight')
    plt.show()
    
    # Visualize Kruskal MST
    if 'kruskal' in first_solutions:
        print("\n2. Visualizing Kruskal MST...")
        edges, cost = first_solutions['kruskal']
        visualize_solution(dist_matrix_1, edges, node_labels_1, 
                         f'Kruskal MST - Dataset 1 (Weight={cost:.0f}, {len(edges)} edges)',
                         f'{folder_name}/kruskal_mst.png')
    
    # Visualize ACO TSP Path
    if 'tsp_same' in first_solutions:
        print("\n3. Visualizing ACO TSP Path...")
        edges, cost = first_solutions['tsp_same']
        visualize_solution(dist_matrix_1, edges, node_labels_1,
                         f'ACO TSP Path - Dataset 1 (Weight={cost:.0f}, {len(edges)} edges)',
                         f'{folder_name}/aco_tsp_path.png')
    
    # Visualize ACO MST
    if 'mst_same' in first_solutions:
        print("\n4. Visualizing ACO MST...")
        edges, cost = first_solutions['mst_same']
        visualize_solution(dist_matrix_1, edges, node_labels_1,
                         f'ACO MST - Dataset 1 (Weight={cost:.0f}, {len(edges)} edges)',
                         f'{folder_name}/aco_mst.png')
    
    # Comparison Plots
    print("\n5. Creating comparison plots...")
    fig, axes = plt.subplots(2, 2, figsize=(16, 12))
    
    # Plot 1: Fair Comparison (n-1 edges)
    ax1 = axes[0, 0]
    fair_data = [
        [v for v in df['Kruskal'].values if v is not None],
        [v for v in df['ACO_TSP_Path_Same'].values if v is not None],
        [v for v in df['ACO_MST_Same'].values if v is not None]
    ]
    ax1.boxplot(fair_data, tick_labels=['Kruskal\n(Optimal)', 'TSP Path\n(Same)', 'MST\n(Same)'])
    ax1.set_title('✓ Fair Comparison (All n-1 edges)', fontsize=14, fontweight='bold')
    ax1.set_ylabel('Total Weight', fontsize=12)
    ax1.grid(True, alpha=0.3) 
    # Plot 2: With Degree Constraint
    ax2 = axes[0, 1]
    deg_data = [
        [v for v in df['ACO_TSP_Path_Deg3_Same'].values if v is not None and v != float('inf')],
        [v for v in df['ACO_MST_Deg3_Same'].values if v is not None and v != float('inf')]
    ]
    if all(len(d) > 0 for d in deg_data):
        ax2.boxplot(deg_data, tick_labels=['TSP Path\nDeg3', 'MST\nDeg3'])
        ax2.set_title('Degree Constraint = 3', fontsize=14, fontweight='bold')
        ax2.set_ylabel('Total Weight', fontsize=12)
        ax2.grid(True, alpha=0.3)
    
    # Plot 3: Bar comparison
    ax3 = axes[1, 0]
    means = [m if m is not None else 0 for m in summary['Mean'].values[:5]]
    colors = ['green', 'blue', 'lightblue', 'purple', 'orchid']
    bars = ax3.bar(range(len(means)), means, color=colors, alpha=0.7)
    ax3.set_xticks(range(len(means)))
    ax3.set_xticklabels(['Kruskal', 'TSP Path\nSame', 'TSP Path\nTuned', 'MST\nSame', 'MST\nTuned'], fontsize=9)
    ax3.set_title('Mean Performance (n-1 edges)', fontsize=14, fontweight='bold')
    ax3.set_ylabel('Mean Weight', fontsize=12)
    ax3.grid(True, alpha=0.3, axis='y')
    
    for bar, val in zip(bars, means):
        if val > 0:
            ax3.text(bar.get_x() + bar.get_width()/2, bar.get_height() + 5,
                    f'{val:.0f}', ha='center', va='bottom', fontsize=9)
    
    # Plot 4: Edge count verification
    ax4 = axes[1, 1]
    edge_counts = [num_vertices - 1, num_vertices - 1, num_vertices - 1]
    labels_edge = ['Kruskal', 'TSP Path', 'MST']
    ax4.bar(labels_edge, edge_counts, color=['green', 'blue', 'purple'], alpha=0.7)
    ax4.set_title('✓ Edge Count Verification (Fair!)', fontsize=14, fontweight='bold')
    ax4.set_ylabel('Number of Edges', fontsize=12)
    ax4.axhline(y=num_vertices - 1, color='r', linestyle='--', label=f'n-1 = {num_vertices - 1}')
    ax4.legend()
    ax4.grid(True, alpha=0.3, axis='y')
    
    for i, (label, count) in enumerate(zip(labels_edge, edge_counts)):
        ax4.text(i, count + 0.1, str(count), ha='center', va='bottom', fontsize=12, fontweight='bold')
    
    plt.tight_layout()
    plt.savefig(f'{folder_name}/fair_comparison.png', dpi=300, bbox_inches='tight')
    plt.show()
    
    # Save results
    df.to_csv(f'{folder_name}/fair_aco_results.csv', index=False)
    
    print("\n" + "="*80)
    print("✅ COMPLETED!")
    print("="*80)
    print(f"\nFiles saved to '{folder_name}/' folder:")
    print("  📊 fair_aco_results.csv - Numerical results")
    print("  📈 fair_comparison.png - Comparison plots")
    print("  🌐 complete_graph.png - Full graph visualization")
    print("  🌳 kruskal_mst.png - Kruskal MST result")
    print("  🛤️  aco_tsp_path.png - ACO TSP Path result")
    print("  🌲 aco_mst.png - ACO MST result")
    
    print("\n💡 KEY FINDINGS:")
    print(f"  • All methods use n-1 = {num_vertices - 1} edges (FAIR!)")
    print(f"  • TSP Path: NO cycle (like MST)")
    print(f"  • Kruskal: {kruskal_mean:.2f} (optimal)")
    print(f"  • ACO TSP Path: {tsp_path_same_mean:.2f} ({tsp_gap:+.2f}%)")
    print(f"  • ACO MST: {mst_same_mean:.2f} ({mst_gap:+.2f}%)")

================================================================================
FAIR ACO COMPARISON: TSP PATH vs MST (SAME n-1 EDGES)
================================================================================

Loading datasets from CSV...
Loading file: datasetNorm/dataset30_ideal.csv
Loaded CSV with 435 rows and 31 columns
Columns: ['Nomor', 'NamaFile1', 'NamaFile2', 'NamaFile3', 'NamaFile4', 'NamaFile5', 'NamaFile6', 'NamaFile7', 'NamaFile8', 'NamaFile9', 'NamaFile10', 'NamaFile11', 'NamaFile12', 'NamaFile13', 'NamaFile14', 'NamaFile15', 'NamaFile16', 'NamaFile17', 'NamaFile18', 'NamaFile19', 'NamaFile20', 'NamaFile21', 'NamaFile22', 'NamaFile23', 'NamaFile24', 'NamaFile25', 'NamaFile26', 'NamaFile27', 'NamaFile28', 'NamaFile29', 'NamaFile30']
Expected edges for 30 vertices: 435
Successfully loaded 30 datasets
Loaded 30 datasets with 30 vertices each

================================================================================
RUNNING EXPERIMENTS...
================================================================================

Dataset 1:
  Kruskal MST: 631.00 (29 edges)
  ACO TSP Path Same: 675.00 (29 edges)
  ACO TSP Path Tuned: 685.00 (29 edges)
  ACO MST Same: 637.00 (29 edges)
  ACO MST Tuned: 739.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 681.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 687.00 (29 edges)
  ACO MST_Deg3_Same: 647.00 (29 edges)
  ACO MST_Deg3_Tuned: 704.00 (29 edges)

Dataset 2:
  Kruskal MST: 619.00 (29 edges)
  ACO TSP Path Same: 655.00 (29 edges)
  ACO TSP Path Tuned: 657.00 (29 edges)
  ACO MST Same: 620.00 (29 edges)
  ACO MST Tuned: 700.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 657.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 652.00 (29 edges)
  ACO MST_Deg3_Same: 622.00 (29 edges)
  ACO MST_Deg3_Tuned: 703.00 (29 edges)

Dataset 3:
  Kruskal MST: 594.00 (29 edges)
  ACO TSP Path Same: 684.00 (29 edges)
  ACO TSP Path Tuned: 684.00 (29 edges)
  ACO MST Same: 605.00 (29 edges)
  ACO MST Tuned: 657.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 690.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 674.00 (29 edges)
  ACO MST_Deg3_Same: 621.00 (29 edges)
  ACO MST_Deg3_Tuned: 701.00 (29 edges)

Dataset 4:
  Kruskal MST: 594.00 (29 edges)
  ACO TSP Path Same: 677.00 (29 edges)
  ACO TSP Path Tuned: 690.00 (29 edges)
  ACO MST Same: 594.00 (29 edges)
  ACO MST Tuned: 653.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 674.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 692.00 (29 edges)
  ACO MST_Deg3_Same: 615.00 (29 edges)
  ACO MST_Deg3_Tuned: 698.00 (29 edges)

Dataset 5:
  Kruskal MST: 594.00 (29 edges)
  ACO TSP Path Same: 688.00 (29 edges)
  ACO TSP Path Tuned: 679.00 (29 edges)
  ACO MST Same: 596.00 (29 edges)
  ACO MST Tuned: 691.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 679.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 687.00 (29 edges)
  ACO MST_Deg3_Same: 613.00 (29 edges)
  ACO MST_Deg3_Tuned: 697.00 (29 edges)

Dataset 6:
  Kruskal MST: 594.00 (29 edges)
  ACO TSP Path Same: 679.00 (29 edges)
  ACO TSP Path Tuned: 684.00 (29 edges)
  ACO MST Same: 598.00 (29 edges)
  ACO MST Tuned: 654.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 679.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 690.00 (29 edges)
  ACO MST_Deg3_Same: 616.00 (29 edges)
  ACO MST_Deg3_Tuned: 690.00 (29 edges)

Dataset 7:
  Kruskal MST: 593.00 (29 edges)
  ACO TSP Path Same: 662.00 (29 edges)
  ACO TSP Path Tuned: 659.00 (29 edges)
  ACO MST Same: 595.00 (29 edges)
  ACO MST Tuned: 689.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 657.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 664.00 (29 edges)
  ACO MST_Deg3_Same: 608.00 (29 edges)
  ACO MST_Deg3_Tuned: 683.00 (29 edges)

Dataset 8:
  Kruskal MST: 593.00 (29 edges)
  ACO TSP Path Same: 666.00 (29 edges)
  ACO TSP Path Tuned: 662.00 (29 edges)
  ACO MST Same: 598.00 (29 edges)
  ACO MST Tuned: 683.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 663.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 659.00 (29 edges)
  ACO MST_Deg3_Same: 605.00 (29 edges)
  ACO MST_Deg3_Tuned: 659.00 (29 edges)

Dataset 9:
  Kruskal MST: 593.00 (29 edges)
  ACO TSP Path Same: 662.00 (29 edges)
  ACO TSP Path Tuned: 655.00 (29 edges)
  ACO MST Same: 596.00 (29 edges)
  ACO MST Tuned: 661.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 664.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 668.00 (29 edges)
  ACO MST_Deg3_Same: 601.00 (29 edges)
  ACO MST_Deg3_Tuned: 676.00 (29 edges)

Dataset 10:
  Kruskal MST: 626.00 (29 edges)
  ACO TSP Path Same: 714.00 (29 edges)
  ACO TSP Path Tuned: 717.00 (29 edges)
  ACO MST Same: 633.00 (29 edges)
  ACO MST Tuned: 719.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 714.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 711.00 (29 edges)
  ACO MST_Deg3_Same: 636.00 (29 edges)
  ACO MST_Deg3_Tuned: 732.00 (29 edges)

Dataset 11:
  Kruskal MST: 626.00 (29 edges)
  ACO TSP Path Same: 714.00 (29 edges)
  ACO TSP Path Tuned: 711.00 (29 edges)
  ACO MST Same: 631.00 (29 edges)
  ACO MST Tuned: 723.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 721.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 720.00 (29 edges)
  ACO MST_Deg3_Same: 633.00 (29 edges)
  ACO MST_Deg3_Tuned: 733.00 (29 edges)

Dataset 12:
  Kruskal MST: 626.00 (29 edges)
  ACO TSP Path Same: 721.00 (29 edges)
  ACO TSP Path Tuned: 716.00 (29 edges)
  ACO MST Same: 629.00 (29 edges)
  ACO MST Tuned: 748.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 713.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 720.00 (29 edges)
  ACO MST_Deg3_Same: 640.00 (29 edges)
  ACO MST_Deg3_Tuned: 695.00 (29 edges)

Dataset 13:
  Kruskal MST: 626.00 (29 edges)
  ACO TSP Path Same: 714.00 (29 edges)
  ACO TSP Path Tuned: 716.00 (29 edges)
  ACO MST Same: 634.00 (29 edges)
  ACO MST Tuned: 709.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 720.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 718.00 (29 edges)
  ACO MST_Deg3_Same: 634.00 (29 edges)
  ACO MST_Deg3_Tuned: 713.00 (29 edges)

Dataset 14:
  Kruskal MST: 613.00 (29 edges)
  ACO TSP Path Same: 689.00 (29 edges)
  ACO TSP Path Tuned: 697.00 (29 edges)
  ACO MST Same: 618.00 (29 edges)
  ACO MST Tuned: 697.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 689.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 693.00 (29 edges)
  ACO MST_Deg3_Same: 616.00 (29 edges)
  ACO MST_Deg3_Tuned: 696.00 (29 edges)

Dataset 15:
  Kruskal MST: 613.00 (29 edges)
  ACO TSP Path Same: 694.00 (29 edges)
  ACO TSP Path Tuned: 692.00 (29 edges)
  ACO MST Same: 625.00 (29 edges)
  ACO MST Tuned: 705.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 696.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 693.00 (29 edges)
  ACO MST_Deg3_Same: 614.00 (29 edges)
  ACO MST_Deg3_Tuned: 703.00 (29 edges)

Dataset 16:
  Kruskal MST: 665.00 (29 edges)
  ACO TSP Path Same: 739.00 (29 edges)
  ACO TSP Path Tuned: 757.00 (29 edges)
  ACO MST Same: 670.00 (29 edges)
  ACO MST Tuned: 752.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 744.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 752.00 (29 edges)
  ACO MST_Deg3_Same: 676.00 (29 edges)
  ACO MST_Deg3_Tuned: 787.00 (29 edges)

Dataset 17:
  Kruskal MST: 665.00 (29 edges)
  ACO TSP Path Same: 744.00 (29 edges)
  ACO TSP Path Tuned: 745.00 (29 edges)
  ACO MST Same: 671.00 (29 edges)
  ACO MST Tuned: 770.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 753.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 757.00 (29 edges)
  ACO MST_Deg3_Same: 674.00 (29 edges)
  ACO MST_Deg3_Tuned: 800.00 (29 edges)

Dataset 18:
  Kruskal MST: 665.00 (29 edges)
  ACO TSP Path Same: 725.00 (29 edges)
  ACO TSP Path Tuned: 762.00 (29 edges)
  ACO MST Same: 675.00 (29 edges)
  ACO MST Tuned: 763.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 756.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 756.00 (29 edges)
  ACO MST_Deg3_Same: 674.00 (29 edges)
  ACO MST_Deg3_Tuned: 791.00 (29 edges)

Dataset 19:
  Kruskal MST: 622.00 (29 edges)
  ACO TSP Path Same: 744.00 (29 edges)
  ACO TSP Path Tuned: 747.00 (29 edges)
  ACO MST Same: 627.00 (29 edges)
  ACO MST Tuned: 736.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 736.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 741.00 (29 edges)
  ACO MST_Deg3_Same: 645.00 (29 edges)
  ACO MST_Deg3_Tuned: 748.00 (29 edges)

Dataset 20:
  Kruskal MST: 622.00 (29 edges)
  ACO TSP Path Same: 734.00 (29 edges)
  ACO TSP Path Tuned: 749.00 (29 edges)
  ACO MST Same: 629.00 (29 edges)
  ACO MST Tuned: 733.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 732.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 738.00 (29 edges)
  ACO MST_Deg3_Same: 648.00 (29 edges)
  ACO MST_Deg3_Tuned: 720.00 (29 edges)

Dataset 21:
  Kruskal MST: 622.00 (29 edges)
  ACO TSP Path Same: 726.00 (29 edges)
  ACO TSP Path Tuned: 740.00 (29 edges)
  ACO MST Same: 623.00 (29 edges)
  ACO MST Tuned: 718.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 740.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 735.00 (29 edges)
  ACO MST_Deg3_Same: 640.00 (29 edges)
  ACO MST_Deg3_Tuned: 720.00 (29 edges)

Dataset 22:
  Kruskal MST: 622.00 (29 edges)
  ACO TSP Path Same: 751.00 (29 edges)
  ACO TSP Path Tuned: 729.00 (29 edges)
  ACO MST Same: 623.00 (29 edges)
  ACO MST Tuned: 726.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 736.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 744.00 (29 edges)
  ACO MST_Deg3_Same: 643.00 (29 edges)
  ACO MST_Deg3_Tuned: 753.00 (29 edges)

Dataset 23:
  Kruskal MST: 609.00 (29 edges)
  ACO TSP Path Same: 719.00 (29 edges)
  ACO TSP Path Tuned: 718.00 (29 edges)
  ACO MST Same: 615.00 (29 edges)
  ACO MST Tuned: 713.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 712.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 717.00 (29 edges)
  ACO MST_Deg3_Same: 642.00 (29 edges)
  ACO MST_Deg3_Tuned: 728.00 (29 edges)

Dataset 24:
  Kruskal MST: 609.00 (29 edges)
  ACO TSP Path Same: 722.00 (29 edges)
  ACO TSP Path Tuned: 728.00 (29 edges)
  ACO MST Same: 611.00 (29 edges)
  ACO MST Tuned: 702.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 717.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 720.00 (29 edges)
  ACO MST_Deg3_Same: 631.00 (29 edges)
  ACO MST_Deg3_Tuned: 730.00 (29 edges)

Dataset 25:
  Kruskal MST: 609.00 (29 edges)
  ACO TSP Path Same: 719.00 (29 edges)
  ACO TSP Path Tuned: 726.00 (29 edges)
  ACO MST Same: 611.00 (29 edges)
  ACO MST Tuned: 704.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 716.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 721.00 (29 edges)
  ACO MST_Deg3_Same: 633.00 (29 edges)
  ACO MST_Deg3_Tuned: 688.00 (29 edges)

Dataset 26:
  Kruskal MST: 609.00 (29 edges)
  ACO TSP Path Same: 726.00 (29 edges)
  ACO TSP Path Tuned: 723.00 (29 edges)
  ACO MST Same: 612.00 (29 edges)
  ACO MST Tuned: 720.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 725.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 730.00 (29 edges)
  ACO MST_Deg3_Same: 648.00 (29 edges)
  ACO MST_Deg3_Tuned: 745.00 (29 edges)

Dataset 27:
  Kruskal MST: 561.00 (29 edges)
  ACO TSP Path Same: 669.00 (29 edges)
  ACO TSP Path Tuned: 676.00 (29 edges)
  ACO MST Same: 566.00 (29 edges)
  ACO MST Tuned: 635.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 677.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 680.00 (29 edges)
  ACO MST_Deg3_Same: 589.00 (29 edges)
  ACO MST_Deg3_Tuned: 663.00 (29 edges)

Dataset 28:
  Kruskal MST: 561.00 (29 edges)
  ACO TSP Path Same: 668.00 (29 edges)
  ACO TSP Path Tuned: 678.00 (29 edges)
  ACO MST Same: 566.00 (29 edges)
  ACO MST Tuned: 626.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 678.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 670.00 (29 edges)
  ACO MST_Deg3_Same: 588.00 (29 edges)
  ACO MST_Deg3_Tuned: 657.00 (29 edges)

Dataset 29:
  Kruskal MST: 561.00 (29 edges)
  ACO TSP Path Same: 667.00 (29 edges)
  ACO TSP Path Tuned: 664.00 (29 edges)
  ACO MST Same: 568.00 (29 edges)
  ACO MST Tuned: 624.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 674.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 677.00 (29 edges)
  ACO MST_Deg3_Same: 592.00 (29 edges)
  ACO MST_Deg3_Tuned: 651.00 (29 edges)

Dataset 30:
  Kruskal MST: 575.00 (29 edges)
  ACO TSP Path Same: 634.00 (29 edges)
  ACO TSP Path Tuned: 637.00 (29 edges)
  ACO MST Same: 579.00 (29 edges)
  ACO MST Tuned: 661.00 (29 edges)
  ACO TSP_Path_Deg3_Same: 632.00 (29 edges)
  ACO TSP_Path_Deg3_Tuned: 638.00 (29 edges)
  ACO MST_Deg3_Same: 582.00 (29 edges)
  ACO MST_Deg3_Tuned: 646.00 (29 edges)

================================================================================
RESULTS TABLE
================================================================================
Dataset  Kruskal  ACO_TSP_Path_Same  ACO_TSP_Path_Tuned  ACO_MST_Same  ACO_MST_Tuned  ACO_TSP_Path_Deg3_Same  ACO_TSP_Path_Deg3_Tuned  ACO_MST_Deg3_Same  ACO_MST_Deg3_Tuned
     D1    631.0              675.0               685.0         637.0          739.0                   681.0                    687.0              647.0               704.0
     D2    619.0              655.0               657.0         620.0          700.0                   657.0                    652.0              622.0               703.0
     D3    594.0              684.0               684.0         605.0          657.0                   690.0                    674.0              621.0               701.0
     D4    594.0              677.0               690.0         594.0          653.0                   674.0                    692.0              615.0               698.0
     D5    594.0              688.0               679.0         596.0          691.0                   679.0                    687.0              613.0               697.0
     D6    594.0              679.0               684.0         598.0          654.0                   679.0                    690.0              616.0               690.0
     D7    593.0              662.0               659.0         595.0          689.0                   657.0                    664.0              608.0               683.0
     D8    593.0              666.0               662.0         598.0          683.0                   663.0                    659.0              605.0               659.0
     D9    593.0              662.0               655.0         596.0          661.0                   664.0                    668.0              601.0               676.0
    D10    626.0              714.0               717.0         633.0          719.0                   714.0                    711.0              636.0               732.0
    D11    626.0              714.0               711.0         631.0          723.0                   721.0                    720.0              633.0               733.0
    D12    626.0              721.0               716.0         629.0          748.0                   713.0                    720.0              640.0               695.0
    D13    626.0              714.0               716.0         634.0          709.0                   720.0                    718.0              634.0               713.0
    D14    613.0              689.0               697.0         618.0          697.0                   689.0                    693.0              616.0               696.0
    D15    613.0              694.0               692.0         625.0          705.0                   696.0                    693.0              614.0               703.0
    D16    665.0              739.0               757.0         670.0          752.0                   744.0                    752.0              676.0               787.0
    D17    665.0              744.0               745.0         671.0          770.0                   753.0                    757.0              674.0               800.0
    D18    665.0              725.0               762.0         675.0          763.0                   756.0                    756.0              674.0               791.0
    D19    622.0              744.0               747.0         627.0          736.0                   736.0                    741.0              645.0               748.0
    D20    622.0              734.0               749.0         629.0          733.0                   732.0                    738.0              648.0               720.0
    D21    622.0              726.0               740.0         623.0          718.0                   740.0                    735.0              640.0               720.0
    D22    622.0              751.0               729.0         623.0          726.0                   736.0                    744.0              643.0               753.0
    D23    609.0              719.0               718.0         615.0          713.0                   712.0                    717.0              642.0               728.0
    D24    609.0              722.0               728.0         611.0          702.0                   717.0                    720.0              631.0               730.0
    D25    609.0              719.0               726.0         611.0          704.0                   716.0                    721.0              633.0               688.0
    D26    609.0              726.0               723.0         612.0          720.0                   725.0                    730.0              648.0               745.0
    D27    561.0              669.0               676.0         566.0          635.0                   677.0                    680.0              589.0               663.0
    D28    561.0              668.0               678.0         566.0          626.0                   678.0                    670.0              588.0               657.0
    D29    561.0              667.0               664.0         568.0          624.0                   674.0                    677.0              592.0               651.0
    D30    575.0              634.0               637.0         579.0          661.0                   632.0                    638.0              582.0               646.0

================================================================================
SUMMARY STATISTICS
================================================================================
              Algorithm       Mean       Std   Min   Max
                Kruskal 610.400000 26.791292 561.0 665.0
      ACO_TSP_Path_Same 699.366667 31.091782 634.0 751.0
     ACO_TSP_Path_Tuned 702.766667 33.590359 637.0 762.0
           ACO_MST_Same 615.166667 27.430012 566.0 675.0
          ACO_MST_Tuned 700.366667 38.968777 624.0 770.0
 ACO_TSP_Path_Deg3_Same 700.833333 31.847641 632.0 756.0
ACO_TSP_Path_Deg3_Tuned 703.466667 32.426053 638.0 757.0
      ACO_MST_Deg3_Same 627.533333 24.495895 582.0 676.0
     ACO_MST_Deg3_Tuned 710.333333 39.142759 646.0 800.0

================================================================================
✅ FAIR COMPARISON ANALYSIS (n-1 edges)
================================================================================

Edge Count: n-1 = 29 edges

1. Kruskal (Optimal): 610.40
2. ACO TSP Path:      699.37
3. ACO MST:           615.17

Gap from Optimal:
  TSP Path vs Kruskal: +14.58%
  MST vs Kruskal:      +0.78%

✅ Fair comparison karena:
  • Same edge count: 29 edges
  • No cycle: TSP Path & MST both are paths/trees
  • Apple-to-apple: Both connect all nodes without cycle

================================================================================
VISUALIZING FIRST DATASET RESULTS
================================================================================

1. Visualizing Complete Graph...

2. Visualizing Kruskal MST...

3. Visualizing ACO TSP Path...

4. Visualizing ACO MST...

5. Creating comparison plots...

================================================================================
✅ COMPLETED!
================================================================================

Files saved to 'results/' folder:
  📊 fair_aco_results.csv - Numerical results
  📈 fair_comparison.png - Comparison plots
  🌐 complete_graph.png - Full graph visualization
  🌳 kruskal_mst.png - Kruskal MST result
  🛤️  aco_tsp_path.png - ACO TSP Path result
  🌲 aco_mst.png - ACO MST result

💡 KEY FINDINGS:
  • All methods use n-1 = 29 edges (FAIR!)
  • TSP Path: NO cycle (like MST)
  • Kruskal: 610.40 (optimal)
  • ACO TSP Path: 699.37 (+14.58%)
  • ACO MST: 615.17 (+0.78%)