Currently it is required that all edge values are of same type and size. For
some algorithms, it might be that some edges need more data than others. It is
fairly easy to accomplish this by writing a size-word and perhaps a type-byte
before each edge data value. However, this means that edge data must be loaded
synchronously with adjacency data as we could not just compute the pointers.
How to implement different types or variable size containers cleanly in the C++
code is a question.
Original issue reported on code.google.com by akyrola...@gmail.com on 27 Jun 2012 at 4:35
Original issue reported on code.google.com by
akyrola...@gmail.comon 27 Jun 2012 at 4:35