fpallas/BWINF-37.2-Dreiecksbeziehungen
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
Finalists solution to BWINF 37 Round 2 - Minimizing the length of the line triangular plots connect to without colliding, using a modified bin packing algorithm.
This repository has been archived on 2026-06-11. You can view files and clone it, but you cannot make any changes to its state, such as pushing and creating new issues, pull requests or comments.
2 commits 1 branch 0 tags 936 KiB
  • C# 100%
Find a file
Exact
Florian Pallas d3c402ac72
 add docs
2023-08-05 04:52:39 +02:00
examples initial commit 2019-10-28 14:04:40 +01:00
Properties initial commit 2019-10-28 14:04:40 +01:00
.gitattributes initial commit 2019-10-28 14:04:40 +01:00
.gitignore initial commit 2019-10-28 14:04:40 +01:00
App.config initial commit 2019-10-28 14:04:40 +01:00
App.xaml initial commit 2019-10-28 14:04:40 +01:00
App.xaml.cs initial commit 2019-10-28 14:04:40 +01:00
Aufgabe2.csproj initial commit 2019-10-28 14:04:40 +01:00
Aufgabe2.pdf add docs 2023-08-05 04:52:39 +02:00
Aufgabe2.sln initial commit 2019-10-28 14:04:40 +01:00
Behaelter.cs initial commit 2019-10-28 14:04:40 +01:00
Berechnung.cs initial commit 2019-10-28 14:04:40 +01:00
Dreieck.cs initial commit 2019-10-28 14:04:40 +01:00
MainWindow.xaml initial commit 2019-10-28 14:04:40 +01:00
MainWindow.xaml.cs initial commit 2019-10-28 14:04:40 +01:00
Matrix.cs initial commit 2019-10-28 14:04:40 +01:00