Skip to content

Flask web based application contains algorithms for solving the Largest Increasing Subsequence and Knights Tour (Open Tour and Closed Tour) problems using graph theory principles.

Notifications You must be signed in to change notification settings

daf2a/Praktikum_Teori_Graf_D11

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Praktikum Teori Graf - Group 11

Group Member

NRP Name Github Account
5025211015 Muhammad Daffa Ashdaqfillah daf2a
5025211021 Daud Dhiya Rozaan daudhiyaa
5025211109 Dewangga Dika Darmawan ddedida

How to run

  • Install requirements
    pip install -r requirements.txt
  • Run the program
    python app.py

Screenshot

Main Menu

main

Largest Increasing Subsequence

Largest Increasing Subsequence find the longest path in the graph
main

Knigth's Open Tour

From last visited node, knight not go back to the starting node
main

Knight's Close Tour

From last visited node, knight go back to the starting node
main

About

Flask web based application contains algorithms for solving the Largest Increasing Subsequence and Knights Tour (Open Tour and Closed Tour) problems using graph theory principles.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages