4 ms·
Graph Theory in the presence of modules and dependencies between modules. Every thing in computing is modular and multiple levels of modules and has coupling a
by gHosts 7y ago
Graph Theory in the presence of modules and dependencies between modules.
Every thing in computing is modular and multiple levels of modules and has coupling and dependencies between modules.
It's the hottest and hardest problem in real world computing... it's nicely representable in a graph theoretic framework.... but graph theorists aren't looking at it.
- princesse 7y agoCan you provide more details? Are you talking about algorithms like modular decomposition[1]? Any specific challenge you'd like to see addressed in the following years? [1] https://en.wikipedia.org/wiki/Modular_decomposition https://en.wikipedia.org/wiki/Modular_decomposition
- gHosts 7y agoEspecially automatic refactorings... If you look at real code, often the main reason why this routine was added to this file... was that the programmer worked in this file last. Is that a Good Reason? No it's a bloody awful reason. An automated tool should be able to look at the network of declarations, definitions and references and work out which module each thing should be in.
- thecupisblue 7y agoI'm using a datastructure like that in my sideproject (a new "software" editor aka a list editor) - you got a data point that exists in multiple dimensions - it has representations in backend, frontend, graphql schema, UI, db, mobile client) and different relationships in each of those dimensions. And it can have subdimensions and they can have their subdimensions etc. So when you update the core representation, all get the update in the dimension they care about. It's a pretty great datastructure for writing code, you get automatic refactor everywhere. If you're interested to take a look ping me, would love fresh eyes