mirror of
https://codeberg.org/qg-info-unterricht/zpg-graphentester.git
synced 2026-03-25 04:58:24 +01:00
First Commit (Fobi)
This commit is contained in:
commit
2bff291a51
336 changed files with 88781 additions and 0 deletions
12
algorithmen/GraphAlgo_TSPGreedyOpt.ctxt
Normal file
12
algorithmen/GraphAlgo_TSPGreedyOpt.ctxt
Normal file
|
|
@ -0,0 +1,12 @@
|
|||
#BlueJ class context
|
||||
comment0.target=GraphAlgo_TSPGreedyOpt
|
||||
comment0.text=\n\n\ Dieser\ Algorithmus\ sucht\ einen\ m\u00F6glichst\ kurzen\ Hamilton-Kreis\ (Traveling\n\ Salesman\ Problem).\n\ Algorithmus\:\ Greedy\ mit\ anschlie\u00DFender\ Optimierung\:\ \n\ Jeder\ Knoten\ wird\ der\ Reihe\ nach\ aus\ der\ Rundreise\ entfernt\ und\ dort\ wieder\ eingef\u00FCgt,\ wo\ die\ Rundreise\n\ sich\ am\ wenigsten\ verl\u00E4ngert.\ Diese\ Optimierung\ wird\ 5x\ wiederholt.\n\n\ @version\ 1.0\ from\ 11.12.2020\n\ @author\ Thomas\ Schaller\n
|
||||
comment1.params=
|
||||
comment1.target=java.lang.String\ getBezeichnung()
|
||||
comment2.params=
|
||||
comment2.target=void\ fuehreAlgorithmusAus()
|
||||
comment3.params=
|
||||
comment3.target=double\ getLaenge()
|
||||
comment4.params=
|
||||
comment4.target=java.lang.String\ getInfo()
|
||||
numComments=5
|
||||
Loading…
Add table
Add a link
Reference in a new issue