Blogs about: 222
Featured Blog
Exercises 22.2-8
We can modify BFS to traverse edge (u,v) twice. The first time is the tree edge (u,v), and the second time is (v,u). … more »
Exercise Lover
Oswalt, Patton - 222
haikumusicreview wrote 4 days ago: Uncut, unrefined, Unique, absurd, relevant. A flabbledy-bloo? … more »
again
.j. wrote 1 week ago: Large changes are imminent, if history’s patterns repeat themselves. in the morning … more »
Yay ... Gnome 2.22 is really really leet!
icebreaker wrote 2 months ago: I finally upgraded to the final version of Hardy Heron, and I was pleasantly impressed by the number … more »
The Week of Birthing
twentyskiptwo wrote 3 months ago: Ew. That just sounds weird. So yeah, this week was primarily defined by that ever-so-enthralling eve … more »
New Club Penguin Life Changing + Unban Chewy Pup!
— 3 comments
disrox111 wrote 4 months ago: Hola! Dis Rox111 here! Im posting for two really big topic’s! The new Club Penguin life ch … more »
22.2
— 1 comment
o m i e wrote 4 months ago: Yesterday was an extremely terrible day for me. It all started first thing in the morning, 1. Woke f … more »
Likely future missions for robotic explorers?
tellinghistory wrote 7 months ago: The current space exploration program led by NASA is shifting into a transition from the human expl … more »
Likely future missions for robotic explorers?
tellinghistory wrote 7 months ago: The current space exploration program led by NASA is shifting into a transition from the human expl … more »
Toshiba 22.2" LCD with 3840 x 2400 Pixels
Jin wrote 8 months ago: Toshiba 22.2″ LCD Pixel Format: 3840 x 2400 Brightness: 235 cd/m2 Contrast Ratio: 300:1 Viewin … more »
Exercises 22.2-8
yuhanlyu wrote 1 year ago: We can modify BFS to traverse edge (u,v) twice. The first time is the tree edge (u,v), and the secon … more »
Exercises 22.2-7
yuhanlyu wrote 1 year ago: BFS from one node s and we can get a node u with maximum d value. Then do BFS from u, find out the n … more »
Exercises 22.2-6
yuhanlyu wrote 1 year ago: The problem is the same as recognizing bipartite graph. Set a node s as good guy, than all its rival … more »
Exercises 22.2-5
yuhanlyu wrote 1 year ago: G = ({s,u,v,w,x}, {(s,u),(s,v),(u,w),(v,x),(u,x),(v,w)}). = {(s,u),(s,v),(u,w),(v,x)}. … more »
Exercises 22.2-4
yuhanlyu wrote 1 year ago: Because d[u] is the distance from s to u, it must be unique. But the BFS tree depends on the order i … more »
Optimistify Me
funeyag wrote 1 year ago: Morning my eyes opened, Ecstasy from last night’s chats coolened, Condensed into a cloud of d … more »
When 5 became 46..
— 1 comment
funeyag wrote 1 year ago: I didn’t want to think that I was living in a dream, because the last time I thought things w … more »
