Fortune Linuxando
_ _ _ _ _ _ _ _ _ _ _ _ _
The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*. -Bart Miller
___ {~._.~} ( Y ) ()~*~() (_)-(_)
export PS1='\e[1;34m\u@\h \w> \e[m '