Activity for Jannis Pohlmann
-
Jannis Pohlmann committed [c2fd0b]
- Add table and iter helpers. Move table.copy() to the table helpers.
-
- Store nodes in an array rather than a dictionary. Update my algorithms.
-
- Add Edge:getOption(), Edge:setOption() and Edge:mergeOptions().
-
- Add positioning helpers. Add table.count_pairs(). Update spring algo.
-
- Fix issues/breakage in the previous commit.
-
- Add spring and wetherelltree algorithms and the Vector class.
-
- Add missing copyrights.
-
- Update generation of TikZ code for edges a tiny bit.
-
- Add naivetree algorithm.
-
- Remove a number of node:getEdges() and edge:getNodes() occurrences.
-
- Store edge nodes in an array. Make table helpers more consistent.
-
- Store node edges in an array instead of a dictionary.
-
Implemented a G_n subgraph for creating grid (or: mesh) graphs.
-
- Use resolvers instead of the kpse library. Add missing vector file
-
- Add table.update_values() and table.combine().
-
- Generate edge code so that options and directions are applied properly.
-
- Update coding style document.
-
- Rework edge TikZ code generation. Add table.map().
-
- Add CODING_STYLE document. Refactor spring algorithm.
-
- Add utility for adjusting the orientation of a graph. Update vector
-
- Fix typo in the vector class.
-
- Implement custom edge keys, styles and math keys for nodes. Pass edge
-
- Move docs to graphdrawing.standard. Add more options. Most notably, this
-
- Merge pgfgdbeginscope and pgf@gd@beginscope. Use {begin,end}group.
-
- Strip redundant semi-colon.
-
- Add helpers for implementing a variety of graph traversal iterators.
-
- Allow edges to be reversed. Add in/out degree and edges methods to Node.
-
- Fix stuff that went missing during the rebase (manual merging = teh
-
- Add experimental layout style. Document the orientation option.
-
- Hook up my own TikZ documentation. Will merge with graphdrawing later.
-
- Rename Node:degree() to Node:getDegree() to improve the API consistency.
-
- Change the semantics of in/out degree and edge methods.
-
- Avoid table corruption in Graph:deleteNode().
-
- Temporarily add edge bend points/nodes. Add crappy layered algorithm.
-
- Add a new iter.times(n) helper to generate n loops.
-
- Move table.merge() to the table helpers, make it more flexible.
-
- Fix table.remove_values() to remove items with table.remove() instead of
-
- Add reversal information to Edge:__tostring().
-
- Further work on the documentation.
-
- Improve the orientation examples.
-
- More options, mostly undocumented.
-
- Add cooling function. Enforce small distance for nodes at same location.
-
- Add a few notes about the spring-electrical algorithm.
-
- Add a variety of vector math functions to the Vector class.
-
- Initial work on a serious spring-electrical algorithm.
-
- Allow algorithms to have spaces and - in their name.
-
- Add missing component packing file.
-
- Nothing important.
-
- Add /graph drawing/register node coordinate key. This key allows
-
- Add TODOs for the spring-electrical algorithm.
-
- Rewrite parseBraces() so that nested braces are properly handled. Nope,
-
- graphdrawing:
-
- Misc logging changes in the walshaw algorithm. Few bugfixes. In
-
- Implement coarsening in the Walshaw algorithm. Add Edge:__eq().
-
- graph drawing:
-
- Allow coordinate keys to be registered. Update orient= syntax. In
-
graph drawing: Flush I/O when verbose mode changes.
-
- Add randomized iterators for tables.
-
- Fix broken graph drawing code caused by merging my changes from
-
- Further work on the Walshaw algorithm.
-
- Fix Walshaw algorithm to properly set the subnodes when copying
-
- graphdrawing:
-
Finish Till's reorganization of the graphdrawing library... sorta.
-
Merge my individual ChangeLog entries. Build all of the PGF manual.
-
- Add at option to the spring-electrical algorithm to fixate nodes.
-
- Add simple force based algorithm based on Hu. Now we have 2-3 to
-
- Fix Vector:__tostring() for vectors with an origin.
-
- Remove old table and iterator helpers. Rename helper files. Rename
-
graph drawing: Implement quadtree in the walshaw algorithm.
-
- graph drawing:
-
graph drawing: Start implementing coarsening in the Hu spring algorithm.
-
graph drawing: Rename algorithms to Walshaw2000, Hu2006 etc. Work on
-
graph drawing: Implement initial parameter values in spring algorithms.
-
graph drawing: be silent, not verbose by default. Adjust the coding
-
Remove old graph drawing files. (I was surprised to see they still
-
graph drawing: Rewrite CoarseGraph:interpolate(). I think it works now.
-
graph drawing: Use the CoarseGraph class in the Walshaw2000 algorithm.
-
graph drawing:
-
graph drawing:
-
Properly forward default node and edge parameters to Lua.
-
graph drawing:
-
graph drawing: Catch -!- edges and remove them from the Lua graph.
-
graph drawing: Improve the code of the Walshaw2000 spring algorithm.
-
graph drawing: Small documentation update. Fix typo in Walshaw2000.
-
graph drawing:
-
graph drawing:
-
graph drawing:
-
Update the ChangeLog.
-
graphdrawing:
-
graphdrawing: Work on node ranking in "GansnerKNV layered".
-
graph drawing: Implement node ranking network simplex in GnanserKNV.
-
graph drawing: Work on Ranking class and node ordering in GansnerKNV.
-
graph drawing: Finish rank ordering in GansnerKNV layered. Sorta.
-
graph drawing: Add table.reverse_value_iter(). Use it in NetworkSimplex.
-
graph drawing: Create standalone NetworkSimplex class.
-
graph drawing: Parse node box coordinates prior to passing them to Lua.
-
graph drawing: Fix bugs in NetworkSimplex, Ranking and GansnerKNV.
-
manual: add a note about the coordinate format passed to node callbacks.
-
graph drawing: Reimplement the network simplex using recursive DFS.
-
graph drawing: Start using the new generic DepthFirstSearch class in NS.
1 >
