Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. Algorithms
  4. Shortes pass find + walls bypassing

Shortes pass find + walls bypassing

Scheduled Pinned Locked Moved Algorithms
algorithmshelpquestion
3 Posts 3 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • A Offline
    A Offline
    alikalik
    wrote on last edited by
    #1

    Hello, I have an image and I mush find the shortest ways to connects points, and walls must be bypassed. http://imageshack.us/photo/my-images/863/exampley.png Can you recommend algorithm(s), that will help to make this program?

    L D 2 Replies Last reply
    0
    • A alikalik

      Hello, I have an image and I mush find the shortest ways to connects points, and walls must be bypassed. http://imageshack.us/photo/my-images/863/exampley.png Can you recommend algorithm(s), that will help to make this program?

      L Offline
      L Offline
      Luc Pattyn
      wrote on last edited by
      #2

      I suggest you start here[^]. :)

      Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum

      Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.

      1 Reply Last reply
      0
      • A alikalik

        Hello, I have an image and I mush find the shortest ways to connects points, and walls must be bypassed. http://imageshack.us/photo/my-images/863/exampley.png Can you recommend algorithm(s), that will help to make this program?

        D Offline
        D Offline
        dasblinkenlight
        wrote on last edited by
        #3

        Look up the maze routing algorithm - it may work for what you're trying to do. Here is an applet[^] that shows you the basic steps of the search (the forward "wave" and the backtracking).

        1 Reply Last reply
        0
        Reply
        • Reply as topic
        Log in to reply
        • Oldest to Newest
        • Newest to Oldest
        • Most Votes


        • Login

        • Don't have an account? Register

        • Login or register to search.
        • First post
          Last post
        0
        • Categories
        • Recent
        • Tags
        • Popular
        • World
        • Users
        • Groups