Skip to content

Mainly algorithms covered in the course Algorithms and Datastructures of the 2022 fall semester at ETH Zürich including generic tests and interfaces.

License

Notifications You must be signed in to change notification settings

SimonWadsack/AnD_AlgoritmsAndTests

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Algorithms and Test Collection - AnD Fall 2022 ETH

This repository contains all algorithms covered in the course "Algorithms and Datastructures" of the 2022 fall semester at ETH Zürich. It also includes generic interfaces and tests for every algorithm type.

DISCLAIMER: This code should not be used in production, this is only a learning source which was created as exam preparation. The algorithms and tests are not optimized for performance nor time or space complexity. You can however use the easy and generic tests to test your own algorithms by implementing the corresponding interface or just use the algorithm implementations to learn them.

License: This code is published under the MIT License, so attribution is not required but appreciated when using this code elsewhere.

Documentation - WORK IN PROGRESS

Algorithms

Searching

Sorting

Graph Exploration and Topological Sorting

Shortest Paths

Minimal Spanning Tree

Tests

How do the tests work?

How can I test my own algorithm?

Interfaces

SearchAlgorithm

SortAlgorithm

GraphExplorationAlgorithm

TopologicalSortingAlgorithm

UnweightedShortestPathAlgorithm

ShortestPathAlgorithm

MinimalSpanningTreeAlgorithm

Utils and Datastructures

The Utils Class

Union Find

Edge and AdjEdge

About

Mainly algorithms covered in the course Algorithms and Datastructures of the 2022 fall semester at ETH Zürich including generic tests and interfaces.

Topics

Resources

License

Stars

Watchers

Forks

Languages