Thank you for replying.
Here "Unicode support" refers to allowing non-ascii characters as
input string, which may be Chinese or Japanese.
It is known that by utf-8 encoding a Chinese character is represented
with 3 bytes, for example, 0xe8b685. Then there raises a problem, if a
utf-8 encoded Chi
What you mean by unicode supprot?
I think only problem is that characters that look the same may have
different encodings.
So it is enough in each compare to use the function that resolves above
problem.
I made 3 suffix tree implementations and it is easy to change string type in
that.
But my impl
I want to know how to solve All Pairs Shortest Paths problem in O(VE)
Time.
I have try to read the paper “Undirected Single-Souce Shortest Paths
with Positive Integer weights in Linear Time”, but cannot understand.
Can anyone explain the algo for me?
--~--~-~--~~~---~--
Does anybody know, by chance, a suffix tree implementation with
Unicode support?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
