[META] Ideas 💡

[moul]

This is an idea dump, some ideas may have already been implemented :)

• generate JSON output
• generic dijkstra that takes a function as argument
• CLI
• "Weight" management (to be defined)
• Export Neo4J
• And/Or nodes, maybe add an helper that generates meta nodes?
• Improve metadata management
• dijsktra on multiple parameters (multiple weight + multiple conditions)
• generate CSV output
• implement remove/hide flag to improve graph manipulation
• airtable import/export
• generate a table output like the slide 44 of this presentation: http://laurent.debize.free.fr/tiis/TIIS1_Graphes.pdf
• implement the MPM method
• Pert: compute max-min; free-margin (margin that doesn't have impact on the roadmap)
• https://en.wikipedia.org/wiki/Complete_graph
• k-vertex-connected-graph: https://en.wikipedia.org/wiki/K-vertex-connected_graph
• IsConnected()
• Convex Hull
• Pert: Total Variance / Sigma / Standard Deviation / Critical Path
• Merkel Tree
• Improve the Pert object to make it easier to use programmatically, generate a struct PertManager{g *Graph} ?
• Use colors for status in Pert (done/available/todo/target)
• Add a way of grouping elements (containers), i.e., group by project/repo
• Gantt
• Pert: TE(longest path / minimal date to achieve); TS(max time imposed by direction);each task can have a TS (TS auto == TE); TL (max time based on TS - TE)
• when we calculate a "critical" / "longest" / "shortest" path; highlight all the other paths with the exact same value (not only one)
• Edit Distance Algorithm
• IsTree()
• https://en.m.wikipedia.org/wiki/Main_path_analysis
• export to OPML
• https://en.m.wikipedia.org/wiki/Treemapping?wprov=sfti1