John Mercier
John Mercier
Awesome project! I found an issue in kernel.sh. I noticed an error ``` virtualbox-iso: mv: cannot stat '/tmp/files/kernel.config': No such file or directory ``` The files is actually copied to...
This will allow the user to lookup the edge between the two vertices and modify it. ```groovy preOrder('A') { from, to -> from.fillcolor = 'green' to.fillcolor = 'green' edge(from.key, to.key)...
connectsFrom creates an edge with 'two' set to the current vertex. It is the opposite of connectsTo where 'one' is set to the current vertex. It is useful for undirected...
Graphs are tightly coupled to type and plugins. A new design for graph to make it strongly typed would be more useful outside of the dsl. There would be classes...
``` given: Graph graph = graph { type: 'weighted-directed-graph' edge('A', 'B') { weight = 0 } edge('B', 'A') { weight = 0 } } def edges = graph.edges expect: edges.size()...
Currently graphs are strict. Only one edge can connect ant two vertices. There is no type for multi edge graphs which allow multiple edges between vertices (except directed). In graphviz...
* Define components of graph ``` graph { edge 'A', 'B' subgraph { edge 'C', 'D' subgraph { edge 'X', 'Y' } } edge 'Y', 'Z' } ``` * When...
It should do the same things but not require all the info
Weighted graphs use compareTo for sorting edges. There should be a way to change the default behavior.
The user guide should be published to gh-pages when a new version of graph-dsl is released.