TRIE data structure!!
On Nov 14, 2007 12:11 PM, srinivas r [EMAIL PROTECTED] wrote:
how to implement t9 dictionary...
wat data structure ca be used?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm
Hi,
i need a little help with an algorithm... an algorithm to recognize a
series-parallel graph using (a adaptation probably) the algorithm for
detecting articulation points in a graph. I have no ideea how this
finally algoritm might look i've open a lot of books on graph
theory data
Series-parallel graphs may be recognized in linear time and their
series-parallel decomposition may be constructed in linear time as
well. See en.wikipedia.org/wiki/Series-parallel_graph. Reference 3 in
that article may be what you are looking for.
Dave
On Nov 14, 5:31 am, fpalamariu [EMAIL
http://www.moneycosmos.com/?r=321740
--~--~-~--~~~---~--~~
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
To unsubscribe from this group, send email
you can also try a suffix tree made for those strings which are
already present in t9.
On Nov 14, 12:32 am, Varun S V [EMAIL PROTECTED] wrote:
TRIE data structure!!
On Nov 14, 2007 12:11 PM, srinivas r [EMAIL PROTECTED] wrote:
how to implement t9 dictionary...
wat data
Given an array of 0's and 1's whenever you encounter an 0 make
corresponding column and row elements 0. How could you do that
efficiently(minimum time and minimum space complexity)? This question
is taken from placementsindia.blogspot.com
--~--~-~--~~~---~--~~
Scan the array. If the i,j element is zero, set the last element of
row i and the last element of column j to zero. Then, scan the last
row, ignoring the last element, and zero every column that ends with a
zero. Similarly, scan the last column, ignoring the last element, and
zero every row that
