|
Posted on 08/31/2025 9:08:15 PM PDT by ransomnote
Many come here to read dispatches from the War between Good and Evil, to red-pill and encourage.....and to pray and give thanks to the God who fights for us.
https://truthsocial.com/@realDonaldTrump/115119962578158249
Q has reminded us repeatedly that together, we are strong. As the false "narrative" is destroyed and the divisive machinery put in place by the Deep State fails, the fact that patriotism has no skin color or political party is exposed for all to see.
3038 Mar 12, 2019 2:55:14 PM EDT
Q !!mG7VJxZNCI ID: 4fe510 No. 5643022>Decide for yourself (be free from outside opinion).
>Decide for yourself (be objective in your conclusions).
>Decide for yourself (be true in your own beliefs).
>Decide for yourself (be open to following the facts).
>Decide for yourself (be strong in defending your beliefs).
>Decide for yourself (be resistant to blindly accepting fact-less statements).
>Decide for yourself (be free)
Those who attack you.
Those who mock you.
Those who cull you.
Those who control you.
Those who label you.
Do they represent you?
Or, do they represent themselves (in some form)?
Mental Enslavement.
The Great Awakening ('Freedom of Thought’), was designed and created not only as a backchannel to the public (away from the longstanding ‘mind’ control of the corrupt & heavily biased media) to endure future events through transparency and regeneration of individual thought (breaking the chains of ‘group-think’), but, more importantly, aid in the construction of a vehicle (a ‘ship’) that provides the scattered (‘free thinkers’) with a ‘starter’ new social-networking platform which allows for freedom of thought, expression, and patriotism or national pride (the feeling of love, devotion and sense of attachment to a homeland and alliance with other citizens who share the same sentiment).
When ‘non-dogmatic’ information becomes FREE & TRANSPARENT it becomes a threat to those who attempt to control the narrative and/or the stable.
When you are awake, you stand on the outside of the stable (‘group-think’ collective), and have ‘free thought’.
"Free thought" is a philosophical viewpoint which holds that positions regarding truth should be formed on the basis of logic, reason, and empiricism, rather than authority, tradition, revelation, or dogma.
When you are awake, you are able to clearly see.
The choice is yours, and yours alone.
Trust and put faith in yourself.
You are not alone and you are not in the minority.
Difficult truths will soon see the light of day.
WWG1WGA!!!Q
In the battle between those who strip us our constitutional rights, we can't afford to let false divisions separate us any longer. We, and our country, will be forever made stronger by diligently seeking the truth, independence and freedom of thought.
Where We Go 1, We Go All
.
What was the speed of Djikstra’s older method?
And are there faster, non-sorting methods?
What was the speed of Djikstra’s older method?
And are there faster, non-sorting methods?
Indians have their own secret job board that allows them to apply for jobs that are hidden from actual Americans. This board caters specifically to H-1Bs. https://t.co/oeDvDQtPIn— Matt Forney (@realmattforney) September 29, 2025
LOL!
Sorry to report that I had to take that Fainting Couch to the dump after FReepers caused me to collapse on it one too many times....
FURRY🐶Colonel takes kink to @NavalAcademy
US Naval Academy allows disgraced Col Brian Connelly (ret) to SPONSOR Midshipmen in Annapolis home🧵
Connelly -PupRavage, a pup-kink polygamist- accesses @NavyMSwim Mids, despite past sexcapades with JOs
📧Rose Clark: sponsor@usna.edu https://t.co/O7U7pNZBot pic.twitter.com/jUSJ3mfqyo— NOVA Campaigns (@NoVA_Campaigns) September 29, 2025
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Another great book!
Reminds me...a Texas Company, Firefly Aerospace (NASDAQ: FLY) is going to land a specialized telescope on the far side of the Moon next year, maybe as early as March. (FLY has the prime contract with NASA, providing the Lunar Module, and subcontracting the launch to SpaceX.)
Just know, if I were ever to say something bad about you, you’d hear it first privately. I owe that to a FR icon.
Get out of my country!
Take your filthy death cult with you!
y/w
That weird "Furry" homosexual perversion apparently started sponsorship at the USNA in 2023. Hopefully, it will quickly be shut down for being the wicked and militarily divisive shite it is.
Col. Brian Connelly (Retired, thankfully - although he should have been court-martialed instead) is a disgrace to the uniform. So are those sponsoring or maintaining this evil fetish.
Wonderful!
😄
| Year | Algorithm/Contribution | Contributor(s) | Description | Time Complexity | Relative Improvement |
|---|---|---|---|---|---|
| 1951 | Matrix-based shortest paths | A. Shimbel | Introduced a method for unit-length all-pairs shortest paths using matrix powers. | O(n^4) | Baseline for early APSP methods. |
| 1955 | Min-sum algebra for shortest paths | A. Shimbel | Developed min-sum matrix multiplication as precursor to Bellman-Ford. | O(n^4) for APSP | Minor refinement over previous matrix method. |
| 1955 | Shortest path as linear programming | A. Orden | Recognized shortest path as a special case of transshipment problem. | Solvable via LP (polynomial time) | Introduced optimization perspective, no specific speedup quantified. |
| 1956 | Ford's algorithm | L.R. Ford | General relaxation method handling negative weights. | O(VE) worst-case, exponential possible | Flexible for negative weights, but potentially slow. |
| 1957 | Early priority-based method | G.B. Dantzig | Method using smallest d(u) + l(u,v) for nonnegative weights. | O(n^2 log n) | Early improvement for nonnegative weights over relaxation methods. |
| 1957 | Improved all-pairs method | Leyzorek et al. | Speedup of Shimbel's method; early Dijkstra-like description. | O(n^3 log n) for APSP | Factor of n/log n faster than O(n^4) for APSP. |
| 1958 | Bellman-Ford algorithm | R. Bellman | Functional equation approach handling negative weights. | O(V^3) dense or O(VE) | Standardized relaxation, up to n times faster than Ford in practice. |
| 1959 | Dijkstra's algorithm | E.W. Dijkstra | Priority queue-based for single-source with nonnegative weights. | O(V^2) | Up to E/V faster than Bellman-Ford for dense graphs. |
| 1959 | Moore's algorithm | E.F. Moore | Refinement of Bellman's for parallel suitability. | O(VE) | Similar to Bellman-Ford, improved for certain implementations. |
| 1962 | Floyd-Warshall algorithm | R.W. Floyd, S. Warshall | Dynamic programming for all-pairs, handles negative without cycles. | O(V^3) | Matches Bellman dense case, simpler for APSP. |
| 1968 | A* search algorithm | P.E. Hart, N.J. Nilsson, B. Raphael | Heuristic search for pathfinding in AI. | Varies with heuristic | Often faster in practice than Dijkstra with good heuristics. |
| 1977 | Johnson's algorithm | D.B. Johnson | APSP for sparse graphs using reweighting and Dijkstra. | O(V^2 log V + VE) | Improves over Floyd-Warshall for sparse graphs by factor ~V. |
| 1984 | Dijkstra with Fibonacci heaps | M.L. Fredman, R.E. Tarjan | Advanced priority queue for better asymptotic. | O(E + V log V) | Θ(&log V) faster than binary heap O(E log V) for sparse graphs. |
| 1999 | Thorup's algorithm | M. Thorup | Linear time for undirected integer weights. | O(E) | Linear time, breaking polylog factors for specific cases. |
| 2022 | Near-linear algorithm for negative weights | A. Bernstein, D. Nanongkai, C. Wulff-Nilsen | Combinatorial near-linear for SSSP with negative weights. | Near O(E) | Vast improvement over Bellman-Ford's O(VE), near-linear time. |
| 2023 | Optimized negative weight algorithm | K. Bringmann, A. Cassis, N. Fischer | Reduced log factors in negative weight SSSP. | Improved near-linear | Reduces overhead by polylog factors over 2022 method. |
| 2025 | Breaking the Sorting Barrier | Ran Duan and team (Tsinghua University) | Deterministic SSSP for directed graphs with non-negative weights, breaking long-standing barrier. | O(m log2/3 n) | Θ(&log1/3 n) faster than O(m log n) implementations; better for sparse graphs over O(m + n log n). |
FIND OUT FRIDAY NIGHTS
“””””
Love it!
🤣 That was good.
Did you live in Iceland?
Disclaimer: Opinions posted on Free Republic are those of the individual posters and do not necessarily represent the opinion of Free Republic or its management. All materials posted herein are protected by copyright law and the exemption for fair use of copyrighted works.
