Repository navigation
Meeting 6
Richard Ng edited this page Aug 25, 2019
·
1 revision
- Realised many teams went for optimal solution rather than just a VALID solution for the basic impl
- Decided on A* algorithm after finding papers related to the scheduling problem
- Parallelisation lightly touched on, ParallelIT/ForkJoin
- Visualisation through JavaFX library and also 3rd party libraries such as GraphViz, GraphStream
- A* vs B&B -> A* faster but need to think about heuristic and memory issues
- A* possibly harder to parallelise??
- Nodes,Edges classes possibly a concern with how many objects are being created
- Decided to use discord instead of messenger, easier to pin threads, and look through ideas rather than scroll up in messenger
- Make sure to make use of Github's issues, wiki more often
- Consistently update our Trello board
- Set out time to properly understand the A* algorithm and pruning techniques as discussed in Oliver Sinnens academic paper
- Everyone is doing a good job with regards to commenting
- Home
- Team Details
- Meeting Minutes
- Project Resources & Specifications
- Conventions
- Basic Implementation
- Optimal Implementation
- Algorithm Optimisations