Home/ Questions/Q 8975665
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-15T18:56:14+00:00

Now begore you would judge me for FAQ my problem is not so easy

  • 0

Now begore you would judge me for FAQ my problem is not so easy as ‘the best shortest path algorithm’ (at least I think).

I have a Google Spreadsheet.

Every row begins with a town name and it’s followed by the nr of roads that go through and by name of of those roads. Something like here bellow: 

Ex. Spreadsheet / First sheet:
         A    |               B               |     C     |     D     |     E     |
 1  Town name | Number of roads you find here | road name | road name | road name |    
 2  Manchester| 3                             |        M1 |        M2 |        M3 |
 3  Leeds     | 1                             |        M3 |           |           |
 4  Blackpool | 2                             |        M1 |        M2 |           |

Now this one Spreadsheet has many worksheets, each for every road name (in my case M1, M2, M3. M1 is the second worksheet since the first one has the content from above. M2 is the third etc)

 Ex. Spreadsheet / Second sheet:
       A      |    B      |        C       |      D       |      E     |      F     |
1   This road | Town name | Distance in km | type of road | other road | other road |  
2      M1     | Manchester|       0        |      M2      |     M3     |            | 
3      M1     | Blackpool |      25        |      M2      |            |            |

Third sheet is similar, next sheets similar structure. One town can be containd in many sheets depending on how many roads link to it. You can see it from the above example.

The Spreadsheet is not made by me. It’s like this. It will not get any better.
I have no problem pulling the data from the google spreadsheet in the program. Reading spreadsheet data with python is not the question here.

  1. What is the best way to write a programme in wxpython/python where a user inputs Starting Town and Finishing Town.
  2. The programme will read the spreadsheet and appropriate worksheets.
  3. Will find somehow the best path in this jungle of worksheets.
  4. It will additionally return the total distance from Starting Town to Finishing town even if the it has to go through maybe more then 2-3 worksheets to get there.
  5. Will return results to the users screen in a lovely form 🙂

I hope you find my problem challenging enough to deserve a questioning.

I beg you for help. Show me the way to go about this very specific problem.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    What came of your previous attempt:

    Way too slow wxPython application getting data from Google Spreadsheet and User input needs speed up solution

    Did you find what was taking so long? What other issues did you encounter there?

    I’m relatively new to stackoverflow but I’ve seen these style questions, that can be interpreted as “Could you write this code for me?”, as being rejected pretty swiftly.

    You might want to consider sharing some of the challenges from the above link and explaining a specific problem within the project.

    UPDATED

    1+5:
    From the WX point of view, you’ll want to keep the UI responsive whilst the search is going on. One way to do this is kick off the searching in a separate thread which calls wx.PostEvent once it has finished. Then in the main wx App you have an event handler which receives the event and processes it. In your case “shows the results on a lovely form”.

    See here for an example: http://wiki.wxpython.org/LongRunningTasks

    • 0