main.dart

import 'dart:convert';

import 'package:collection/collection.dart';

import 'node.dart';
import 'utils.dart';

enum Algorithm { AStar, SimpleAStar, UniformCost }

List<dynamic> readStateFromProgramParameters(List<String> arguments) {
  if (arguments.isNotEmpty) {
    return jsonDecode(arguments[0]);
  }

  throw Exception("No arguments passed");
}

Algorithm readAlgorithmFromProgramParameters(List<String> arguments) {
  if (arguments.length > 1) {
    switch (arguments[1]) {
      case 'AStar':
        return Algorithm.AStar;
      case 'SimpleAStar':
        return Algorithm.SimpleAStar;
      case 'UniformCost':
        return Algorithm.UniformCost;
      default:
        throw Exception("Invalid algorithm passed");
    }
  }

  return Algorithm.AStar;
}

var PROGRAM_ALGORITHM = Algorithm.AStar;

void main(List<String> arguments) {
  Stopwatch stopwatch = Stopwatch()..start();

  PROGRAM_ALGORITHM = readAlgorithmFromProgramParameters(arguments);

  final initialState = readStateFromProgramParameters(arguments);
  final node = Node.fromParameters(initialState);

  var currentNode = node;

  Map<String, List<Node>> visitedNodes = {};
  final openedNodes = SortedList<Node>((a, b) => a.cost.compareTo(b.cost));

  while (true) {
    if (currentNode.isGoal()) {
      break;
    }

    if (visitedNodes[currentNode.stateToString()] == null) {
      visitedNodes[currentNode.stateToString()] = [];
    }

    visitedNodes[currentNode.stateToString()]!.add(currentNode);

    final children = currentNode.generateChildren();

    children.forEach((child) {
      final hasBetterNode = visitedNodes[child.stateToString()]?.any((element) => element.cost < child.cost) ?? false;

      if (!hasBetterNode) {
        openedNodes.add(child);
      }
    });

    currentNode = openedNodes.first;

    openedNodes.removeAt(0);
  }

  print('Tempo de execução: ${stopwatch.elapsed}');
  print('Quantidade de nodos visitados: ${visitedNodes.length}');
  print('Quantidade de nodos abertos: ${openedNodes.length}');
  print('Quantidade de passos para resolver o problema: ${currentNode.goalPath.length}');

  print('\nLista de passos para resolver o problema:');

  currentNode.goalPath.forEachIndexed((index, node) {
    print("Passo ${index + 1}: ${node.getDescriptionOfThePerformedStep()}");
  });
}