Some of you may remember TINT, or TI Number Theory, a TI-BASIC package/library designed for number theoretic calculations and analysis that is now over 2 years old. In retrospect, though, TINT was not all that useful to the average programmer, since number theory is a fairly niche subject (and passion of mine) that really requires more substantial hardware to even attempt to delve into seriously. But, hey; it was a nice project and I still encourage anyone and everyone to give it a try.
Well, I am now working on a much more expansive and hopefully more popular BASIC library: TIGHT, or TI GrapH Theory (what, did you want me to call it TIGT?). TIGHT is a collection of lists and subprograms that allow for the creation, manipulation, and analysis of discrete graphs; that is, points and lines in the plane that are connected in various ways.
Graphs come up in all sorts of realms of computer science and mathematics, and can be represented quite succinctly using TI-BASIC lists, be them directed or undirected. Currently, TIGHT has support for most basic graph operations: adding/removing edges, finding subgraphs, checking adjacency, and layout & plotting. Actual downloads are not yet available, but the source code and user guide can all be found on the GitHub repo.
Here's a sample of what you can do with TIGHT, as a more visual teaser:
(don't worry; there are colors too!)
As always, comments, critiques, and suggestions for the code are welcome as issues on the repo or messages in IRC. Plenty of updates to come, with an initial release planned before the end of the year.
Well, I am now working on a much more expansive and hopefully more popular BASIC library: TIGHT, or TI GrapH Theory (what, did you want me to call it TIGT?). TIGHT is a collection of lists and subprograms that allow for the creation, manipulation, and analysis of discrete graphs; that is, points and lines in the plane that are connected in various ways.
Graphs come up in all sorts of realms of computer science and mathematics, and can be represented quite succinctly using TI-BASIC lists, be them directed or undirected. Currently, TIGHT has support for most basic graph operations: adding/removing edges, finding subgraphs, checking adjacency, and layout & plotting. Actual downloads are not yet available, but the source code and user guide can all be found on the GitHub repo.
Here's a sample of what you can do with TIGHT, as a more visual teaser:
(don't worry; there are colors too!)
As always, comments, critiques, and suggestions for the code are welcome as issues on the repo or messages in IRC. Plenty of updates to come, with an initial release planned before the end of the year.
