What the Four Color Theorem Can Teach Us About Writing Software

23 bookmarks. First posted by kamal january 2018.

"There is a caveat to the four color theorem. The graph has to be planar. That means no edges can cross each other. It has to be able to embedded on a two dimensional plane without crossings"

18 days ago
by sanjayjc
march 2018
by clos

An easy to approach theory from the math world that lends insight to how complex software becomes complex. Everything in your software is probably more interconnected than you think, and it only becomes more difficult over time to untangle it.

And definitely check out the interactive examples to get a good feel for how complex things can get.

learn-programming
And definitely check out the interactive examples to get a good feel for how complex things can get.

february 2018 by mergesort

The four-color theorem provides a way to think about the complexity of graphs, which maps nicely to software.

january 2018 by e2b

The four-color theorem provides a way to think about the complexity of graphs, which maps nicely to software.

complexity
software
dependencies
graph
engineering
january 2018 by hynek

Beschreibung wie die Komplexität von Graphen (Karten) direkt mit den Farben korrespondieren. Anhand dieses Schemas gezeigt wie die Komplexität beim kombinieren von Graphen steigt je nachdem wie man sie einbindet.

Daraus dann die Analogie zur Quellcode Modul Strukturierung gezogen

programming
math
bestpractices
collaboration
communication
arbeit
via:popular
Daraus dann die Analogie zur Quellcode Modul Strukturierung gezogen

january 2018 by rauschen

january 2018 by xer0x

january 2018 by garrettqmartin

What the Four Color Theorem Can Teach Us About Writing Software

from twitter_favs
january 2018 by joseph