Hello,
Thankfully it does not need to be in dot language. I have invested minimally in it. I am also realizing that this parser is very complex. I dont need any of the complexity graphviz offers. I think you are right though I need to use my own parser or maybe looking into another format.

Thank You for your priceless advice!
EF

On Sat, Sep 4, 2010 at 1:36 PM, Jeremiah Willcock <jewillco@osl.iu.edu> wrote:
On Sat, 4 Sep 2010, ef wrote:

Yeah sadly it is a very huge graph (atleast 300 million nodes). I have also written aglorithms that do the analysis while they are created, otherwise it would just be to complex. I will go ahead and look into your suggestions.

Does that large of a graph need to be in Graphviz format?  The parser is complicated because the language itself is complicated (such as attributes for subgraphs).  If you are writing the graph yourself, you might want to use a simpler format (like DIMACS); even if someone else is producing it in Graphviz format, you may want to consider writing a custom parser that only handles the subset of the language that your file uses and creates your graph type directly.


-- Jeremiah Willcock
_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users