u/PirlGerson

What is Jijitsu Kaisen about?

So every irl person I know is going crazy over this jijitsu kaisen, but I however, do not see the appeal at all. I tried to watch the show several times and couldn't stomach it. Is there something I'm missing? Precisely what exactly is jijitsu kaisen about? I don't understand what the story like revolves around? What characters do poeple like? I hate all of these little bricks! (except Gojo)

I don't care about spoilers, just explain what the idea is. It's making me mad. I got spoiled a lot of breaking bad and (though I wish I went in blind) the little details I heard about hooked me and I didn't mind knowing a little about the future so long as I knew like what the main idea of the show is. Thank you.

OK so apparently people don't god damn understand what I meant. I meant THEMATICALLY. not LITERLLY what happens in the god damn show.

reddit.com
u/PirlGerson — 3 days ago

Graph Theory] What the heck is the procedure being recommended in this paper?

https://docs.google.com/document/d/1y5GqbppSnOnsvb3GA7kGcejMhQ6100Lt4mo0RsH5YJU/edit?usp=sharing

Above is a link to an image showing an algorhytm to determine the shortest path from 1 source on a planar graph. I understand the start, it say to use the method of determining the balanced split of a planar graph, and to do it nlog/nloglog number of times (n = total number of vertexes.) From there I have no idea. It seems we like convert the boundary of the pieces into complete graphs or something. Idk. I'm very stupid. PLs explain like im 5 (no proof talk). Thank yall even for just reading this big ahh wall of text. Love. PirlGerson.

u/PirlGerson — 10 days ago

This article claims to have a method to count cycles of cubic polyhedral graphs. I however do not understand it. How does it work, and could you single out ONE cycle with the same method to find a cycle?

https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1142?msockid=0176a848e9e16ddc1096bcbce8596cf1

ALSO has there been any research on similar methods on 4 regular graphs and above? I'm aware finding Hamiltonian cycle borders on only crackable by brute force. But since polyhedral are such symmetrical structurers, and since this article claims it found one for cubic, could it be done?

Also just in advance, thank you all for helping so much lately, I've been hitting SO MANY walls cus graph theory uses a lot of jargo and I don't even know how to prove things. With my current situation I don't have the spare time to learn proves quite yet. So thank any of yall that've decide and already have helped me already.

reddit.com
u/PirlGerson — 21 days ago