Starting with tag: [TAG graph-includes 0.9.1 Yann Dirson **20050601220619] [documented target architecture Yann Dirson **20050611083843] [Start of a "tutorial" or "how to use" section in the doc Yann Dirson **20050627215824] [More hints to break cycles Yann Dirson **20051102205315] [releasing as 0.9.2 Yann Dirson **20051102210249] [TAG graph-includes 0.9.2 Yann Dirson **20051102211100] [fixed version for 0.9.2 Yann Dirson **20051109213742] [TAG graph-includes 0.9.2 Yann Dirson **20051109213803] [typo Yann Dirson **20051109221751] [more TODO Yann Dirson **20051109221809] [generalized design: grouping is a transformation Yann Dirson **20051109223610] [Fixed typo Yann Dirson **20051128213233] [Splitted dot-specific code into its own class Yann Dirson **20051128213300 This is not rocket science, but just a first sketch for a renderer class. It only serves to code isolation and renderer prototyping for now - it is especially not possible yet to use another renderer without modifying the main script to use another renderer class. ] [Add a --renderer flag Yann Dirson **20051128214931] [Added missing copyright notices Yann Dirson **20051128215650] [Introduced an abstract renderer class Yann Dirson **20051128220011 It provides default implementations for set_* methods, to allow incremental implementation of derived classes. ] [Fixed handling of dot flags Yann Dirson **20051128232209 Had been broken since the split into a renderer class. ] [Use node labels, not internal IDs, to identify dependencies Yann Dirson **20051128232359 This makes it easier to write a renderer object. ] [Add a preliminary tulip renderer Yann Dirson **20051128232731 This renderer only defines node labels. No clustering, color, or anything fancy yet. ] [Updated documentation for tulip support Yann Dirson **20051128233151] [Mentionned download URLs for graphviz and tulip Yann Dirson **20051128233608] [Prepared for 0.10 Yann Dirson **20051128234445] [TAG graph-includes 0.10 Yann Dirson **20051128234610] [Use File::Spec functions for path handling Yann Dirson **20051204225125 This is the first try at improving portability to non-unix platforms. ] [Advertize the requirement for perl 5.8 or List::Util Yann Dirson **20051205205020] [Document win32 portability Yann Dirson **20051205205154] [Fixed parsing of --color arguments Yann Dirson **20051205213900] [Minor cleanup of multilevel grouping Yann Dirson **20051205214815 Should now be easier to read, but still not implemented in the right place. ] [Commented out debugging output Yann Dirson **20051205214949] [Fix/implement multi-level group coloring Yann Dirson **20051205232244 Support for this had never been fully implemented. It had arbitrary limitations. Current implementation is not the definitive one, it should really be moved to a read styling system, so coloring can be done for tulip as well without coding it twice. ] [Don't attempt to colorize nodes inside a group represented as single node Yann Dirson **20051205233735 This obviously causes conflicts on the colors to be used, and gives unsatisfactory visual result. ] [BUGS++ Yann Dirson **20051205235617] [Give an example command to graph itself Yann Dirson **20051206204135] [Reformatted invocation examples Yann Dirson **20051206204218] [Add a get_default_sysincludes() method to extractor.pm Yann Dirson **20051206211052 Used for default -sysInclude values ] [Added a minimal get_default_sysincludes() for C Yann Dirson **20051206211921] [Added get_default_sysincludes() support for perl Yann Dirson **20051206211954] [Updated doc for default -sysI values Yann Dirson **20051206212033] [Release as 0.11 Yann Dirson **20051206212419] [TAG graph-includes 0.11 Yann Dirson **20051206212454] [TODO++ Yann Dirson **20051206220354] [Convert the documentation to DocBook XML Yann Dirson **20051208215703] [Some TODO reorg Yann Dirson **20051208223320] [more TODO Yann Dirson **20051208223754] [Write down GUI ideas Yann Dirson **20051208225430] [more TODO Yann Dirson **20051209000232] [Dropped the internal "nodeid" stuff from core Yann Dirson **20051209001553 Only dot used it, although it has turned out that properly quoted strings achieve the original purpose. Tulip does have a need for numeric node ids, but this is already handled in the tulip module. ] [Fixed uniqueincludes Yann Dirson **20051209004006 Had never been updated after the split of C-specific stuff out of project classes in 0.6. ] [Set version to WIP Yann Dirson **20051209004247] [Lock objects' hash keys in constructors Yann Dirson **20051209225020 This provides assertions in case of error, especially as I'm going to deeply restructure those classes. ] [more TODO Yann Dirson **20051209225957] [Removed old TREE field in projects Yann Dirson **20051209230657 Has been unused since ages. ] [bugs++ Yann Dirson **20051209235348] [Removed debugging output in perl extractor Yann Dirson **20051210221905] [More TODO on perl extractor Yann Dirson **20051210222633] [Introduce graph objects Yann Dirson **20051210223025 Only the first step: many operations were just syntactically modified to look for the same information in the new place, so now we can see where the things to rework next are :) Stats are definitely broken, I did not bother to rework them at this point. ] [Make the NODES graph member private Yann Dirson **20051211211652] [Moved record_dep from project to graph and make getdeps directly modify GRAPHS[0] Yann Dirson **20051212215257] [Simplify record_dep Yann Dirson **20051212222216] [Pass the graph to be filled directly to getdeps() Yann Dirson **20051212222901] [Make the EDGES graph member private Yann Dirson **20051212223024] [Note problems in windows Yann Dirson **20051212225413] [Indentation fix Yann Dirson **20051213214344] [Use real node objects Yann Dirson **20051220212822] [Store nodes as a hash indexed by label Yann Dirson **20051220213630] [Rework transitive reduction to produce a new graph instead of modifying the original Yann Dirson **20051221222650 Also remove as much knowledge of graph internals as possible, and add new methods as needed, to get some advancement in making reduction an independant transformation. ] [Promote has_path to a graph method Yann Dirson **20051221232533] [Fix the display of reduction count in verbose mode Yann Dirson **20051221233455] [more TODO Yann Dirson **20051221234101] [Move check of transitive reduction to new is_reduction_of graph method Yann Dirson **20051221234440 May not really belong to graph, but that's good enough for now. ] [Use "edge" instead of "dependency" in graph method names Yann Dirson **20051222111336]