@janhardo 

My experience is really limited, as I only have used it for a couple of days.

As a minus first, it does not show logical errors in the code, undefined variables, and syntax errors like the Maple editor does.

On the plus side it has code colouring, and lists the names of procedures in the code in a side window (if you have the Maple language addin installed). It also has GitHub connection, which makes this part very easy.

Regarding reasons why I came up with this see https://www.mapleprimes.com/questions/238887-Read-In-Maple-Code-Attachments

(...plus recommendation by one of my daugthers)

@acer 

I'm not sure where the $include statement is valid, and where it is not.

When trying to put it in the startup code for example that does not seem to work.

But putting it into a Maple Code attachment and read this from the startup code is no problem on the other hand.

Any ideas?

@acer 

Thanks a lot for your help, I think I'm up and running.

One of my daugthers recommended Visual Studio Code to me, and it looks like there is an addon for Maple syntax highlighting. I've also registered on GitHub, and have committed my first uploads to a repository.

Code is not running yet, but so far it looks very promising.

@acer 

I've tried different approaches, but I just get "Error, invalid `$` operator" with the $include command.

Could you post a simple maple file which I can download to check what I am doing wrong?

Or is this just working when using the compiler, not the interpreter?

@acer 

I'd like to add that to a wishlist for future development - add a chapter to the Maple Programming Guide.

How to setup and use a version control system.

@acer 

Seems like a very interesting approach, but I would need a litte bit more information for implementation.

Does that mean that you are not using the Maple Code Editor either?

Could you provide a simple example on how you do that?

@acer 

The reason for this is that I have a library module with very many procedures, and I want to split it to different files, so that it easier to work with them. Thus I can open them in different windows and work with them in parallel.

Do I understand that correctly, that

• each procedure that is defined needs to be unprotected before and after the definition?
• they need to be listed under ModuleLoad?
• that z5:-times1 := eval(:-times1) locks the definition and protects it to any future changes
  Does that mean that even if I change the code and rerun the main program, it will not be changed? Or does the unprotect command allow the redefinition?

@Scot Gould 

Yes, I have seen that one.

It was very useful, one can be very glad when the best share their skills.

Would a similar workflow be possible to Maple also?

@acer 

Probably you guys know what the meaning of "...as if it had been entered or read from a file" is, but for other users (like me) the meaning of this sentence is not obvious.

I still stand by what I wrote, that the help file should be more specific here.

@acer 

If that is the case (which I am sure it is), the help file should be updated.

@Carl Love 

I have no real experience with ChatGPT, but what I heard is that it just makes things up.

In my case I replied that this function isn't exisiting, ChatGPT excused that it was wrong, and came up with 2 alternatives which also didn't work.

But everything was very convincing :-)

First of all I have to say that I have never worked with Graphs, so please bear that in mind when answering my questions.

In the BavarianCities example of the GraphTheory:-TravelingSalesman explanation, the CompleteGraph function is used to generate all possible edges between the cities.

Might be that you just didn't use it in your example, but as far as I can see some possible edges like 1 - 3 and 2 - 5 are missing.

What I would like to have is a solution that either just starts in 1 and gives the shortest route to all other points, or starts in 1 and ends in 5, with the shortes route between those start- and endpoints - including all points and not using an edge two times.

@sand15 

Thanks for the tip, I do however see one issue.

The Travelling Salesman Problem apparently requires to go back to the starting point. This is not in my case, I do not want to get back to the starting point, but just want to connect them in the shortest possible way.

The background for my specific problem is that I need to calculate the capacity of a timber connection with bolts, where the bolts are in random order. For that I need the minimum net area of the section. The starting point will be a point on the edge nearest to the outermost bolt on the one side. The end point will be a point on the opposite side, nearest to the outermost bolt on the other side.

The GraphTheory:-TravelingSalesman allows to define a startvertex, which is helpful. But as far as I can see it will also end in that point.

Regarding ChatGPT, I've just used it as I don't have any clue about how to tackle the problem :-)

@acer 

Perfect, thanks.