Can you allow more siggy characters because 900 is minimal? I mean, most people just use their siggy to put guides in, but I have too many ...solution? Yeah, this could be both suggestion/help thread... A siggy rarely is anything spammy anyways, just advertising for trades and guides...
Re: More PM Characters Allowed? Oh, sorry, I'm kinda f**ked up today Lolz...more siggy space, I just edited it Yeah, sorry, I'm being stupid *knocks self out*
Upped to 1500 There are ways to shorten your signature though (like look at mine ). I may make a guide about it...
How do you like it now, Zer0? Mine looks exactly like yours Looks actually pretty cool :tehe: Oh, and you might also want to change the warning on teh edit page of your siggy to 1500.
Psh way to be original... poser... :nope: Its automatically changed when the limit is changed. Someone brought it back down to 900 for some reason :/
NOOOO I viciously HATEHATEHATE long sigs. They make reading threads a pain in the booty because 70% of a user's post space will be their sig. SO ANNOYING. We should have a rule that the bottom of your siggy will not surpass 10 lines or 500 pixels in height or something.
ditto I recognize people by their sigs so I don't usually turn them off. However sigs that take up a good part of the page are...obnoxious. Short sigs ftw...seriously go look at smelly's sig (best/most useful/concise sig ever <3 ).
Just change someone's sig if you feel that its too long. I don't know if there's a clean way of automatically enforcing that rule. EDIT: ok there is, I'll install that mod once I get around to it.
Zer0, your siggy in on the edge of beeing way too long. Before, it was 5 lines. I've always broke the rule but Lightning's one is too much. I've got a scroll button on my mouse but it ain't suppose to spin that much Edit: just found a convenient way of knowing if the siggy is too long. If your siggy make the left part of your post (information/avatar/rep/award) strech at the bottom, it's too long. Mine is fine, yours too but sorry Lightning, time to shrink.
Or maybe we could just all press the CTRL button while scrolling (basically, it makes the text smaller).
I was going to propose that but I realized it'd depend on the size of your post. Why, what's this? Lightning's sig has magically shrunk? Whomever would do such a thing!
fail at recognizing sarcasm (i.e. it wasn't me) Tharoux/Phee: Its difficult to gauge how many lines a signature is because it also depends on your monitor resolution. I have a 1440x900 monitor so by my screen, my signature comes 3-4 lines short of overflowing my info section.
qft Let P be a connected, weighted graph. At every iteration of Prim's algorithm, an edge must be found that connects a vertex in a subgraph to a vertex outside the subgraph. Since P is connected, there will always be a path to every vertex. The output Y of Prim's algorithm is a tree, because the edge and vertex added to Y are connected. Let Y1 be a minimum spanning tree of P. If Y1=Y then Y is a minimum spanning tree. Otherwise, let e be the first edge added during the construction of Y that is not in Y1, and V be the set of vertices connected by the edges added before e. Then one endpoint of e is in V and the other is not. Since Y1 is a spanning tree of P, there is a path in Y1 joining the two endpoints. As one travels along the path, one must encounter an edge f joining a vertex in V to one that is not in V. Now, at the iteration when e was added to Y, f could also have been added and it would be added instead of e if its weight was less than e. Since f was not added, we conclude that w(f) \ge w(e). Let Y2 be the graph obtained by removing f and adding e from Y1. It is easy to show that Y2 is connected, has the same number of edges as Y1, and the total weights of its edges is not larger than that of Y1, therefore it is also a minimum spanning tree of P and it contains e and all the edges added before it during the construction of V. Repeat the steps above and we will eventually obtain a minimum spanning tree of P that is identical to Y. This shows Y is a minimum spanning tree. Other algorithms for this problem include Kruskal's algorithm and Borůvka's algorithm.