Help us understand the problem. What is going on with this article?

迷路を作って解くJava実装

本文

  • やったこと:Javaで迷路を作り、到達可能か求める(深さ優先探索 DFS)、または最短経路を求める(幅優先探索 BFS)
  • ソース => GitHub
  • 実行結果 => Ideone
  • その他の入力例 => README

実行時の注意

  • 6つの引数が必須、順番は固定
  • -debugで迷路・経路を標準出力に書き込める
    • ただし出力量制限はない
    • 小さい迷路から大きな迷路へ、どのくらい表示できるか確認しながら出力した方がいい
  • -debugの代わりに-no-denugとか適当に入れれば標準出力OFFになる
  • 大きさは2501*2501を超えた辺りから、生成の実行時間が長くてつらい
  • 4つ目の引数circuitsに大きな数字を入れると、生成の実行時間が長くてやっぱりつらい
    • 100000とか無理

雑感

  • 迷路を作る実装はレアかも
  • 1.最短距離と2.書き換えた経路の両方を返す方が好ましいが、面倒なのでやってない

Hope this helps.

Why not register and get more from Qiita?
  1. We will deliver articles that match you
    By following users and tags, you can catch up information on technical fields that you are interested in as a whole
  2. you can read useful information later efficiently
    By "stocking" the articles you like, you can search right away
Comments
No comments
Sign up for free and join this conversation.
If you already have a Qiita account
Why do not you register as a user and use Qiita more conveniently?
You need to log in to use this function. Qiita can be used more conveniently after logging in.
You seem to be reading articles frequently this month. Qiita can be used more conveniently after logging in.
  1. We will deliver articles that match you
    By following users and tags, you can catch up information on technical fields that you are interested in as a whole
  2. you can read useful information later efficiently
    By "stocking" the articles you like, you can search right away
ユーザーは見つかりませんでした