Sökning: "bfs algoritm"

Hittade 3 uppsatser innehållade orden bfs algoritm.

  1. 1. Machine learning - neuroevolution for designing chip circuits/pathfinding

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Pontus Brink; Jonathan Rinnarv; [2017]
    Nyckelord :Machine learning; Neural Network; NEAT; pathfinding;

    Sammanfattning : Neural Networks have been applied in numeral broad categories of work. Such as classification, data processing, robotics, systemcontrol e.t.c. LÄS MER

  3. 2. Genetic algorithms in mazes : A comparative study of the performance for solving mazes between genetic algorithms, BFS and DFS.

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Anton Jonasson; Simon Westerlind; [2016]
    Nyckelord :;

    Sammanfattning : In this report, genetic algorithms were compared to BFS and DFS for solvingmazes with regards to computational time and solution path length. This wasdone by creating mazes with Wilson's algorithm and running several tests ina controlled environment. LÄS MER

  4. 3. CluStic – Automatic graph drawing with clusters

    Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Villiam Aspegren; [2015]
    Nyckelord :Graph drawing; Automatic graph layout; Directed graphs; Sugiyama; Cluster; Clusters;

    Sammanfattning : Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been barely explored however, is that users would like to specify portions of their layouts that are not altered by such algorithms. LÄS MER