# voidengine

Prague, Czech Republic

n/a

Age: 34

ex-perlmonk

now deep in c#/asp.net with an occasional FP adventure

graph & AI enthusiast

 2d awarded Autobiographer Jan 13 comment Algorithm of calculating the right coefficient1500/60==3000/120==1000/40==25 Jan 13 comment Algorithm of calculating the right coefficientCall that a qualified guess based on how you describe when the font "looks good" Jan 11 revised Algorithm of calculating the right coefficientadded 295 characters in body Jan 11 answered Algorithm of calculating the right coefficient Jan 3 awarded Yearling Jan 3 awarded Yearling Jan 2 comment What is a minimum spanning forest?That would be a forest, but by no means a spanning one. Where there's a path in the (disconnected) graph, there must be one in the spanning forest as well. The wording of the definition may of course differ, but the essence won't. Jan 2 comment What is a minimum spanning forest?@Labo are you saying that forest is a subset of vertices? That just doesn't make sense Dec 17 answered Designing an Algorithm to find the length of a simple cycle in a d-regular graph Nov 23 awarded Enlightened Apr 1 comment Reading user's posts to pages@matrixanomaly well, it may be better than `page/feed`, but it still doesn't solve that I don't know which pages the user has posted to Apr 1 asked Reading user's posts to pages Mar 18 awarded Custodian Mar 18 answered Some claims on shortest path between two vertex in Diagraph? Mar 16 reviewed Looks Good Improper output using libusb Mar 16 reviewed Requires Editing How to alert a user to click logout when he wants to leave the website? Mar 16 reviewed Requires Editing href with a slide in picture Mar 16 answered Sprague–Grundy theorem in MATLAB Mar 16 comment Sprague–Grundy theorem in MATLABdoes the graph in question have any special properties, e.g. is it acyclic? For a cyclic graph, using recursion wouldn't be a good idea, since you could get into an endless loop