Advanced 7 min read
Brute-force to begin with
The traveling salesman in our example problem has it pretty lucky — he only has to travel between four cities. For simplicity’s…
THE ARTICLE LIBRARY
All stories.
Ideas and explainers from across SenseCentral.
Advanced 6 min read
The Trials And Tribulations Of The Traveling Salesman
Aswe dive deeper and deeper into the world of computer science, one thing starts to become very clear, very quickly:…
Advanced 5 min read
Dynamic programming to the salesman’s rescue
Now that we’ve identified our overlapping and recurring subproblems, there’s only one thing left to do: eliminate the repetition, of…
Advanced 6 min read
Turning TSP on its head
If we look at our top down methodology from last week, we’ll see that we have enumerated through all of the…
Advanced 6 min read
Speeding Up The Traveling Salesman Using Dynamic Programming
Alarge part of what makes computer science hard is that it can be hard to know where to start when…
Advanced 5 min read
A token of my affection (for my parser)
If ambiguity is the root of all parse tree evil, then clarity is clearly the preferred mode of operation. Sure,…
Advanced 6 min read
Parsing expressions like it’s our job
Okay, so we now know how to diagram and parse an English language sentence. But how does that apply to…
Advanced 7 min read
Grammatically Rooting Oneself With Parse Trees
Thinking about all of the abstractions that surround us in the world of technology can sometimes be overwhelming. This is…
Advanced 6 min read
Evaluating the important parts
Once we’ve finished scanning our source text and identified our lexemes, we’ll need to do something with our lexeme “words”. This is…
Advanced 12 min read
Reading Code Right, With Some Help From The Lexer
Software is all about logic. Programming has garnered a reputation of being a field that is heavy on the math…