Click here to Skip to main content
15,068,471 members
Articles / General Programming / Algorithms


5 bookmarked

Graph is everywhere

Rate me:
Please Sign up or sign in to vote.
5.00/5 (8 votes)
29 Aug 2015CPOL1 min read
The traditional way to solve the ZigZag Conversion problem is to either build a 2d table or find a pattern among the index of the letters on the same row. There is also a beautiful solution which builds on top of Breadth First Search. Continue reading..



This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


About the Author

Eric Z (Jing)
Technical Lead National Instruments
China China
Senior software engineer at National Instruments, to implement various Ethernet-based industrial protocols, e.g., EtherCAT. Favorite languages are C/C++ and Python. For fun, I like watching films (sci-fi, motion), walking, and various reading.

Comments and Discussions