text:
The Color Purple (musical)
From Wikipedia, the free encyclopedia
Jump to: navigation, search
The Color Purple
Original poster from The Broadway Theatre production, 2005
Music
Stephen Bray
Brenda Russell
Allee Willis
Lyrics
Stephen Bray
Brenda Russell
Allee Willis
Book
Marsha Norman
Basis
The Color Purple by Alice Walker
Productions
2005 Broadway
2007 Chicago
2007 1st U.S. Tour
2010 2nd U.S. Tour
2011 Vienna
2012 3rd U.S. Tour
2013 Off-West End
2015 Broadway revival
2016 Australia
2017 U.S. Tour
Awards
2016 Tony Award for Best Revival of a Musical
2016 Drama League Award for Outstanding Revival of a Musical
2017 Grammy Award for Best Musical Theater Album
The Color Purple is a musical with a book by Marsha Norman and music and lyrics by Stephen Bray, Brenda Russell, and Allee Willis. Based on the 1982 novel by Alice Walker, the show follows the journey of Celie, an African-American woman in the American South from the early to mid-20th century.
The original Broadway production ran from 2005 to 2008, earning eleven Tony Award nominations in 2006. An enthusiastically acclaimed Broadway revival opened in late 2015 and ran through early 2017, winning two 2016 Tony Awards—including Best Revival of a Musical.
Contents
[hide]
1 Productions
1.1 Workshop and world premiere (2004–2005)
1.2 Broadway (2005–2008)
1.3 First national tour (2007–2010)
1.3.1 Chicago (2007)
1.4 Second national tour (2010–2011)
1.5 Third national tour (2012)
1.6 London production (2013)
1.7 Broadway revival (2015–2017)
2 Synopsis
2.1 Act I
2.2 Act II
3 Cast
3.1 Original casts of notable productions
3.2 Cast replacements
4 Musical numbers
5 Awards and nominations
5.1 Original Broadway production
5.2 2015 Broadway revival
6 References
7 External links
Productions[edit]
Workshop and world premiere (2004–2005)[edit]
The Color Purple was originally workshopped by the Alliance Theatre in Atlanta, Georgia, in the summer of 2004 following Scott Sanders' optioning the work from Alice Walker in 1999 and auditioning various creative team members. The September 9, 2004, world premiere of the musical was produced by the Alliance Theatre in Atlanta by special arrangement with Creative Battery and Scott Sanders Productions.
For the Atlanta run, La Chanze starred as Celie, Felicia P. Fields as Sofia, Saycon Sengbloh as Nettie, Adriane Lenox as Shug and Kingsley Leggs as Mister. Gary Griffin staged the work, with scenic design by John Lee Beatty, lighting by Brian MacDevitt, costumes by Paul Tazewell and sound by Jon Weston.[1][2]
Broadway (2005–2008)[edit]
The musical opened on Broadway at The Broadway Theatre on December 1, 2005. It was directed by Gary Griffin, produced by Scott Sanders, Quincy Jones and Oprah Winfrey, with choreography by Donald Byrd and musical direction by Linda Twine. The musical closed on February 24, 2008, after 30 previews and 910 regular performances. The Broadway production recouped its $11 million investment within its first year on Broadway, and had grossed over $103 million by the time it closed.[3]
The original Broadway production starred LaChanze as Celie, Brandon Victor Dixon as Harpo, Felicia P. Fields as Sofia, Renée Elise Goldsberry as Nettie, Kingsley Leggs as Mister, Krisha Marcano as Squeak, and Elisabeth Withers-Mendes as Shug Avery.
First national tour (2007–2010)[edit]
Chicago (2007)[edit]
The First National tour began on April 17, 2007, starting with an extended run at the Cadillac Palace Theatre in Chicago, Illinois. The company includes LaToya London as Nettie, Michelle Williams as Shug Avery, Felicia P. Fields as Sofia, and Jeannette Bayardelle as Celie, Stephanie St. James as Squeak. Bayardelle and Fields both are reprising their roles from Broadway. The show exceeded expectations, which necessitated a four-week extension of its Chicago engagement until September 30, 2007.[4] The original expectation was that the show would run in Chicago until November.[5] In all, the show produced respectable business results bringing in about $1 million per week for the first half of the engagement, but less during the summer months when the ticket prices were reduced to $39.50 to keep the theater full.[6]
Chicago was notable as a starting point of the national tour because Oprah Winfrey, a 1986 Academy Awards nominee in the film adaptation[7] is a Chicago resident.[8][9] In addition, Felicia Fields is a Chicago native and resident. It was also a homecoming for Gary Griffin. Both Fields and Griffin made their broadway theatre debuts with this musical.[10] As a result of the Chicago connections the Chicago premiere had a star-studded red carpet with Chicago Mayor Richard M. Daley, Jesse Jackson, R. Kelly, and Roger Ebert.[11] Others in attendance included United States Senator Carol Moseley Braun and Christie Hefner.[12] Coverage of the Chicago premiere was prominent in international media.[13]
Second national tour (2010–2011)[edit]
A second national tour with a new non-Equity cast opened on March 12, 2010 at the Lyric Opera House and visited numerous US cities, making several return engagements. The role of Celie was played by Detroit native Dayna Jarae Dantzler. The role of Shug Avery was played by New Orleans native Taprena Augustine. Tour stops include Omaha, Nashville, Fort Lauderdale, Mobile, Durham, and more.[14][15] Due to an overwhelming demand, the tour returned to New Orleans where it played a 5-show limited-engagement at the Mahalia Jackson Theater for the Performing Arts from February 11–13, 2011.[16] In August 2010, Oprah Winfrey announced the traveling company of The Color Purple would be raising funds for the relief organization SBP along with the novel's author, Alice Walker.[17]
Third national tour (2012)[edit]
A third national tour with a non-Equity cast opened January 17, 2012 at the Francis Marion University PAC, in Florence, South Carolina, with previews in New Haven, CT at the Schubert Theater. The role of Celie is played by Washington, D.C. native, Ashley L. Ware, and Taprena Augustine has reprised her role as Shug Avery alongside Dayna Quincy taking the role of Nettie (later taking the role of Celie at Toby's Dinner Theatre in Columbia). Tour stops include Nevada (Las Vegas & Reno), Alabama (Mobile), Pennsylvania (Williamsport, Reading & Bloomsburg), and more.[15]
London production (2013)[edit]
A first international production, directed by John Doyle, opened in London at The Menier Chocolate Factory on July 17, 2013. The limited run ended on 14 September 2013. The cast included Cynthia Erivo (Celie), Nicola Hughes (Shug) and Christopher Colquhoun (Mister/Albert).
Broadway revival (2015–2017)[edit]
On January 9, 2015, producers Scott Sanders, Roy Furman, and Oprah Winfrey announced that the Menier Chocolate Factory production would be mounted on Broadway. Jennifer Hudson makes her Broadway debut in the role of Shug, Danielle Brooks plays the role of Sofia, and Cynthia Erivo reprises her role as Celie. Kyle Jean-Baptiste was slated to be in it as well, but he died in August 2015.[18][19] Previews began November 10, 2015, with the official opening December 10 at the Bernard B. Jacobs Theatre.[20][21][22] Erivo won the 2016 Tony Award for Best Actress in a Musical, with the production taking home the 2016 Tony Award for Best Revival of a Musical.[23] The production closed on January 8, 2017.[24]
Synopsis[edit]
Act I[edit]
On a Sunday morning in 1909, fourteen-year-old Celie – who has had one child by her father Alphonso and is now pregnant with her second – plays a clapping game with her younger sister Nettie. While attending services with the other members of their rural Georgia community, Celie goes into labor and is dragged out of the church as the congregation quietly looks on ("Huckleberry Pie/Mysterious Ways"). After Celie gives birth to a son, her father takes the child away and bluntly tells her he is going to get rid of it like the last one. Celie quietly says goodbye to her newborn and asks God for a sign ("Somebody Gonna Love You").
Four years later, local farmer and widower Albert "Mister" Johnson approaches Alphonso and asks permission to marry one of his daughters. Alphonso agrees, offering him Celie, instead of Nettie, and throwing a cow into the bargain. Although the girls promise never to be separated, Celie goes with Mister to save Nettie's dreams of becoming a teacher ("Our Prayer"). The local Church Ladies cluck their approval ("That Fine Mister") while Mister's field hands introduce Celie to a life of hard work ("Big Dog").
One day, Nettie arrives, explaining that she is tired of Alphonso's lecherous attentions and asking if she can stay. Mister agrees, but later attacks Nettie while she is walking to school. She fights back, prompting Mister to kick her out. Celie protests, but Mister swears they will never see each other again. As she leaves Mister's property, Nettie promises to write to Celie. But when she goes to the mailbox the next day, Mister slams the mailbox shut, threatening to kill her if he ever sees her touch it. ("Lily of the Field").
In 1920, Mister's son Harpo brings home Sofia, a strong-willed woman whom he later marries ("Dear God - Sofia"). When he complains that he is tired of Sofia bossing him around, Mister and Celie tell him the only way to get her to listen is to beat her. Harpo attempts to do so but ends up being beaten by Sofia ("A Tree Named Sofia"). After confronting Celie, Sofia learns the extent of Mister's cruelty and tells Celie to stand up for herself before leaving home to spend time with her sisters ("Hell No!").
Harpo decides to turn his house into a juke joint and engages in an affair with a waitress named Squeak, who moves in with him ("Brown Betty"). Sometime later, the community prepares for the arrival of jazz singer Shug Avery, who is revealed to be Mister's longtime lover ("Shug Avery Comin' to Town"). But when Shug arrives with her band, she is in such bad shape that Celie nurses her back to health in spite of local disapproval ("All We've Got to Say").
While tailoring a dress for Shug's debut, Celie experiences feelings of warmth and tenderness for the first time ("Dear God - Shug"). Shug, meanwhile, learns more about Celie's relationship with Mister and encourages her to find her inner strength ("Too Beautiful for Words"').
That night, at Harpo's Juke Joint, Shug brings down the house with a raucous blues number ("Push Da Button"). Sofia arrives with her new boyfriend Buster and dances with Harpo, prompting Squeak to pick a fight with her ("Uh Oh!"). The fight eventually escalates into a bar brawl, prompting Shug and Celie to escape.
After returning to Mister's house, Shug and Celie explore their newfound relationship ("What About Love?"). Shug uncovers several letters for Celie that have come from Africa. Celie recognizes Nettie's handwriting and realizes that her sister is alive ("Act I Finale").
Act II[edit]
While reading the letters that Mister has hidden from her, Celie learns that Nettie is in Africa and is living with the missionary family that adopted her children ("African Homeland"). In Georgia, Sofia is arrested for assaulting the mayor after refusing to work for his wife. When Celie goes to visit her, she learns Sofia will serve out her sentence in the Mayor's custody.
In 1932, Shug brings her lover Grady over for Easter. After learning the extent of Celie's anger towards God, Shug invites her to come back to Memphis with her so they can enjoy the simple joys of life ("The Color Purple"). After sitting down to dinner ("Church Ladies' Easter"), Celie tells Mister that she is leaving and Squeak announces she is leaving as well.
When Mister refuses and tries to beat her, Celie stands firm and curses him ("I Curse You, Mister"). Harpo then invites Sofia to come back and live at the Juke Joint, reconciling with her in the process. Eventually, Mister begins to feel the effect of Celie's curse. Harpo challenges his father to make things right after a bunch of terrible things happen to Mister, which force Mister to try to understand the meaning of Celie's curse and the meaning of life other than his tough childhood. ("Mister's Song/Celie's Curse").
At Shug's Memphis home, Celie starts writing back to Nettie and discovers that she has a natural gift for making pants. After inheriting her childhood home, Celie starts a business and begins selling her designs ("Miss Celie's Pants"). Meanwhile, Harpo and Sofia hit it off and then the two learn that Mister is having difficulty getting Nettie and the children to come to the United States. The three resolve to make a plan. ("Any Little Thing")
Shug tells Celie that she has fallen in love with a 19-year-old musician in her band and asks her permission to have one last fling with him. Meanwhile, Mister has reconciled his life ("What About Love? [Reprise]"). While walking home, Celie realizes that she isn't destroyed by this and, for the first time, feels a deep love for herself ("I'm Here").
Several years later, while hosting a Fourth of July picnic for the community, Celie hears a car horn and a familiar voice from her childhood. It is Nettie singing the clapping song they sang years ago. They both run to each other and hug with Celie's children right behind them all grown up. After learning that Mister and Shug have made the reunion possible, Celie thanks them and God for reuniting her with her sister ("The Color Purple [Reprise]").
Cast[edit]
Original casts of notable productions[edit]
Character
2005 Broadway
2007 U.S. Tour
2010 U.S. Tour
2013 Off-West End
2015 Broadway Revival
2016 Australia
2017 U.S. Tour
Celie
LaChanze Jeannette Bayardelle Kenita R. Miller Cynthia Erivo Jayme-Lee Hanekom Adrianna Hicks
Shug Avery
Elisabeth Withers Michelle Williams Angela Robinson Nicola Hughes Jennifer Hudson Thando Sikwila Carla R. Stewart
Sofia
Felicia P. Fields Sophia Nomvete Danielle Brooks Vanessa Menjivar Carrie Compere
Mister/Albert
Kingsley Leggs Rufus Bonds, Jr. Christopher Colquhoun Isaiah Johnson Kendrew A. Heriveaux Gavin Gregory
Harpo
Brandon Victor Dixon Stu James Adebayo Bolaji Kyle Scatliffe Iopu Auva'a J. Daughtry
Nettie
Renée Elise Goldsberry LaToya London Abiona Omonua Joaquina Kalukango Anna Francesca Armenia N'Jameh Camara
Cast replacements[edit]
Jeannette Bayardelle assumed the role of Celie from LaChanze in the original Broadway production on November 5, 2006.
Kenita R. Miller assumed the role of Celie from Jeannette Bayardelle in the original Broadway production on February 20, 2007.
Fantasia Barrino assumed the role of Celie in the original Broadway production from April 10, 2007, to January 6, 2008, becoming the first American Idol winner on Broadway.[25]
Fantasia reprised her performance as Celie in the 2010 National tour from June 30 to September 13, 2010.
Heather Headley assumed the role of Shug Avery from Jennifer Hudson in the 2015 Broadway revival on May 10, 2016.[26]
Jennie Harney assumed the role of Nettie from Joaquina Kalukango in the 2015 revival on September 20, 2016.[27]
Jennifer Holliday assumed the role of Shug Avery from Heather Headley in the 2015 revival on October 4, 2016.
Carrie Compere assumed the role of Sofia from Danielle Brooks in the 2015 revival on November 15, 2016.[28]
Nathaniel Stampley assumed the role of Mister from Isaiah Johnson in the 2015 revival on November 15, 2016. [29]
Musical numbers[edit]
Act I
"Overture" – Orchestra
"Huckleberry Pie" / "Mysterious Ways" – Young Celie and Young Nettie / Celie, Nettie and Ensemble
"Somebody Gonna Love You" – Celie
"Our Prayer" – Nettie, Celie, Mister, Doris, Darlene, Jarene and Pa
"That Fine Mister" – Doris, Darlene and Jarene
"Big Dog" – Mister, Celie, Young Harpo, Mister's Daughters and Male Ensemble
"Lily of the Field" – Celie, Nettie and Mister
"Dear God - Sofia" – Celie
"A Tree Named Sofia" – Doris, Darlene and Jarene
"Brown Betty" – Harpo, Squeak, Celie and Male Ensemble
"Shug Avery Comin' to Town" – Mister, Celie and Ensemble
"All We've Got to Say" – Doris, Darlene and Jarene
"Dear God - Shug" – Celie and Shug
"Too Beautiful for Words" – Shug
"Push Da Button" – Shug, Harpo and Ensemble
"Uh-Oh!" – Sofia, Squeak, Celie, Buster and Female Ensemble
"What About Love?" – Celie and Shug
"Act I Finale" – Orchestra, Shug, Celie and Nettie
Act II
"African Homeland" – Nettie, Celie, Young Adam, Young Olivia and Ensemble
"The Color Purple" – Shug and Celie
"Church Ladies' Easter" – Doris, Darlene and Jarene
"I Curse You Mister" – Celie and Mister
"Mister's Song - Celie's Curse" – Mister
"Miss Celie's Pants" – Celie, Shug, Sofia and Female Ensemble
"Any Little Thing" – Harpo and Sofia
"What About Love? (Reprise)" – Celie and Shug
"I'm Here" – Celie
"The Color Purple (Reprise)" – Celie and Company
Awards and nominations[edit]
Original Broadway production[edit]
Year
Award Ceremony
Category
Nominee
Result
Ref
2006 Tony Award Best Musical Nominated [30]
Best Book of a Musical Marsha Norman Nominated
Best Original Score Brenda Russell, Allee Willis and Stephen Bray Nominated
Best Actress in a Musical LaChanze Won
Best Featured Actor in a Musical Brandon Victor Dixon Nominated
Best Featured Actress in a Musical Felicia P. Fields Nominated
Elizabeth Withers-Mendez Nominated
Best Choreography Donald Byrd Nominated
Best Scenic Design John Lee Beatty Nominated
Best Costume Design Paul Tazewell Nominated
Best Lighting Design Brian MacDevitt Nominated
Theatre World Award Felicia P. Fields Won [31]
Elisabeth Withers-Mendes Won
2007 Grammy Award Best Musical Show Album Nominated
Theatre World Award Fantasia Barrino Honoree [32]
2015 Broadway revival[edit]
Year
Award Ceremony
Category
Nominee
Result
Ref
2016 Tony Award Best Revival of a Musical Won [33]
Best Actress in a Musical Cynthia Erivo Won
Best Featured Actress in a Musical Danielle Brooks Nominated
Best Direction of a Musical John Doyle Nominated
Drama Desk Award Outstanding Revival of a Musical Nominated [34]
Outstanding Actress in a Musical Cynthia Erivo Won
Outstanding Featured Actress in a Musical Danielle Brooks Nominated
Outstanding Director of a Musical John Doyle Won
Outstanding Orchestrations Catherine Jayes and Joseph Joubert Nominated
Outstanding Lighting Design for a Musical Jane Cox Nominated
Drama League Award Outstanding Revival of a Musical Won [35]
Distinguished Performance Cynthia Erivo Nominated
Jennifer Hudson Nominated
Outer Critics Circle Award Outstanding Revival of a Musical Nominated [36]
Outstanding Actress in a Musical Cynthia Erivo Won
Outstanding Featured Actress in a Musical Danielle Brooks Nominated
Theatre World Award Cynthia Erivo Honoree [37]
Danielle Brooks Honoree
2017 Grammy Award Best Musical Theater Album Won [38]
Daytime Emmy Award Outstanding Musical Performance in a Daytime Program Cynthia Erivo and Cast of The Color Purple for "The Color Purple" on The Today Show Won [39][40]
References[edit]
Jump up ^ "Alice Walker Novel Sings as 'The Color Purple' Musical Starts World Premiere, Sept. 9" playbill.com, September 2004
Jump up ^ Broadwayworld.com, March 2004 "Alliance Theatre to Premiere 'The Color Purple' A New Musical" broadwayworld.com, 2004
Jump up ^ "Broadway's 'The Color Purple' Will Close Feb. 24" playbill.com, January 24, 2008.
Jump up ^ Hetrick, Adam (2007-07-17). "The Color Purple Extends Chicago Run By a Month". Playbill News. Playbill, Inc. Retrieved 2008-01-15.
Jump up ^ "The Color Purple to Begin National Tour in Chicago in 2007". Broadway.com, Inc. 2006-03-06. Retrieved 2008-01-15.
Jump up ^ Jones, Chris (2007-09-28). "'Color Purple' makes its exit". chicagotribune.com. Retrieved 2008-01-15.
Jump up ^ "The Color Purple (1985)". rogerebert.com. 2004-03-28. Retrieved 2008-01-15.
Jump up ^ "Oprah at Chicago premiere of 'Purple'". USA TODAY. 2007-05-06. Retrieved 2008-01-15.
Jump up ^ "Oprah Winfrey attends Chicago premiere of "The Color Purple"". the International Herald Tribune. 2007-05-03. Retrieved 2008-01-17.
Jump up ^ Morgan, Scott C. (2007-05-09). "Theater: The Color Purple". Windy City Times. Windy City Media Group. Retrieved 2008-01-15.
Jump up ^ Baca, Stacey (2007-05-04). "Winfrey attends Chicago premiere of 'The Color Purple'". ABC Inc., WLS-TV/DT Chicago, IL. Retrieved 2008-01-15.
Jump up ^ "Oprah's 'Purple' Opens In Chicago: Local Celebrities Step Onto Red Carpet". NBC Universal, Inc. 2007-05-04. Retrieved 2008-01-15.
Jump up ^ "People: Avril Lavigne, Oprah Winfrey, Don Imus". the International Herald Tribune. 2007-05-04. Retrieved 2008-01-17.
Jump up ^ "'The Color Purple' tour listing" phoenix-ent.com
^ Jump up to: a b [1] colorpurple.com
Jump up ^ [2] facebook.com
Jump up ^ Flaherty, Jordan (2010). Floodlines: Community and Resistance from Katrina to the Jena Six. Chicago, Illinois: Haymarket Books. pp. 130–131. ISBN 9781608460656.
Jump up ^ "Kyle Jean-Baptiste, 1st Black Actor to Play Jean Valjean on Broadway, Dies in Fall". CBS News. August 29, 2015. Retrieved August 30, 2015.
Jump up ^ Rutti, Ron (August 29, 2015). "Baldwin Wallace Graduate Kyle Jean-Baptiste, Youngest to Play 'Les Miserables' Lead, Is Dead at 21". The Plain Dealer. Cleveland. Retrieved August 30, 2015.
Jump up ^ "Jennifer Hudson Will Make Broadway Debut in Color Purple Revival". Playbill.com. 2015-01-09. Retrieved 2015-04-01.
Jump up ^ Hetrick, Adam and Viagas, Robert. "Broadway 'Color Purple' Revival With Jennifer Hudson and Cynthia Erivo Sets Full Cast" Playbill, October 6, 2015
Jump up ^ Playbill Staff. "The Verdict: Read Reviews for Broadway 'Color Purple' Revival, With Jennifer Hudson and Cynthia Erivo" playbill.com, December 11, 2015
Jump up ^ "The Tony Award Nominees - Winners". TonyAwards.com. Retrieved 2016-06-21.
Jump up ^ Viagas, Robert. "Broadway 'Color Purple' Posts Closing Notice", Playbill, October 30, 2016
Jump up ^ "American Idol's Fantasia Barrino to Join The Color Purple". broadwayworld.com. Wisdom Digital Media. 2007-02-22. Retrieved 2008-01-15.
Jump up ^ Paulson, Michael. "Jennifer Hudson to Exit 'Color Purple'; Enter Heather Headley" The New York Times, April 7, 2016
Jump up ^ McPhee, Ryan. "Broadway Newcomer Jennie Harney Will Join The Color Purple" Broadway.com., September 7, 2016
Jump up ^ Viagas, Robert. "Broadway’s 'The Color Purple' Is Getting a New Sofia" Playbill, October 13, 2016
Jump up ^ BWW News Desk. "THE COLOR PURPLE to Welcome New 'Mister' on Broadway" BroadwayWorld.com, October 24, 2016
Jump up ^ Staff, Playbill (June 12, 2006). "Just the Facts: List of 2006 Tony Award Winners and Nominees". Playbill.com. Retrieved April 28, 2016.
Jump up ^ Staff, Broadway.com (May 12, 2006). "Winners of the 2006 Theatre World Awards Announced". Broadway.com. Retrieved April 28, 2016.
Jump up ^ Staff, New York Theatre Wire. "63rd ANNUAL THEATRE WORLD AWARD WINNERS ANNOUNCED". New York Theatre Wire. Retrieved April 28, 2016.
Jump up ^ Respers France, Lisa (June 13, 2016). "Tony Awards 2016: The Winners List". CNN. Retrieved June 14, 2016.
Jump up ^ Viagas, Robert (April 28, 2016). "She Loves Me Leads Drama Desk Nominations". Playbill.com. Retrieved April 28, 2016.
Jump up ^ Gans, Andrew (April 20, 2016). "2016 Drama League Awards Nominations Announced". Playbill.com. Retrieved April 20, 2016.
Jump up ^ Viagas, Robert (April 19, 2016). "2016 Outer Critics Circle Nominees Announced". Playbill.com. Retrieved April 19, 2016.
Jump up ^ Gans, Andrew (May 2, 2016). "Theatre World Awards Announce 2016 Winners". Playbill.com. Retrieved June 14, 2016.
Jump up ^ "2017 Grammy Awards: Complete list of nominees". Los Angeles Times. December 6, 2016. Retrieved December 6, 2016.
Jump up ^ "The 44th Annual Daytime Emmy Award Nominations" (PDF). New York City: emmyonline.org and National Academy of Television Arts and Sciences. March 22, 2017. Retrieved March 22, 2017.
Jump up ^ "The 44th Annual Daytime Creative Arts Emmy Awards Winners" (PDF). Los Angeles: emmyonline.org and National Academy of Television Arts and Sciences. March 22, 2017. Retrieved April 29, 2017.
External links[edit]
Official site
The Color Purple at the Internet Broadway Database
The Color Purple Audition Advice & Show Information from MusicalTheatreAudition.net
The Color Purple at Broadway Theater
Wanabehuman: Theatre review - The Color Purple, New York City
The Color Purple on Broadway.com
[show]
v
t
e
Tony Award for Best Revival of a Musical
Carousel (1994)
Show Boat (1995)
The King and I (1996)
Chicago (1997)
Cabaret (1998)
Annie Get Your Gun (1999)
Kiss Me, Kate (2000)
42nd Street (2001)
Into the Woods (2002)
Nine (2003)
Assassins (2004)
La Cage aux Folles (2005)
The Pajama Game (2006)
Company (2007)
South Pacific (2008)
Hair (2009)
La Cage aux Folles (2010)
Anything Goes (2011)
Porgy and Bess (2012)
Pippin (2013)
Hedwig and the Angry Inch (2014)
The King and I (2015)
The Color Purple (2016)
Hello, Dolly! (2017)
[show]
v
t
e
Daytime Emmy Award for Outstanding Musical Performance in a Daytime Program
Rachel Platten (2016)
Cynthia Erivo and the Cast of The Color Purple (2017)
[show]
v
t
e
Works by Alice Walker
Books
The Third Life of Grange Copeland (1970)
Meridian (1976)
The Color Purple (1982)
The Temple of My Familiar (1989)
Possessing the Secret of Joy (1992)
Warrior Marks (1993)
Short stories
"Everyday Use" (1973)
Collections
In Search of Our Mothers' Gardens (1983)
Adaptations
The Color Purple (film)
The Color Purple (musical)
Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Color_Purple_(musical)&oldid=809321805"
Categories:
2005 musicals
All-Black cast Broadway shows
Broadway musicals
Musicals based on novels
Musicals based on films
LGBT-related musicals
Hidden categories:
Articles with IBDb links
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
Português
Edit links
This page was last edited on 8 November 2017, at 12:14.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

values: mw-page-base noprint

values: mw-head-base noprint

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

value: span

attrs: href class title

values:
/wiki/The_Broadway_Theatre
mw-redirect
The Broadway Theatre

values: Tony Award for Best Revival of a Musical

values:
/wiki/2006_Tony_Awards
mw-redirect
2006 Tony Awards

values:
/wiki/2016_Tony_Awards
mw-redirect
2016 Tony Awards

values: Edit section: Workshop and world premiere (2004–2005)

values: Edit section: First national tour (2007–2010)

values:
/wiki/Chicago,_Illinois
mw-redirect
Chicago, Illinois

values:
/wiki/The_Color_Purple_(1985_film)
mw-redirect
The Color Purple (1985 film)

values:
/wiki/Chicago_Mayor
mw-redirect
Chicago Mayor

values:
/wiki/United_States_Senator
mw-redirect
United States Senator

values: Edit section: Second national tour (2010–2011)

values:
/wiki/Lyric_Opera_House
mw-redirect
Lyric Opera House

values:
/wiki/Fort_Lauderdale
mw-redirect
Fort Lauderdale

values: Edit section: Third national tour (2012)

values: Edit section: Broadway revival (2015–2017)

values: Tony Award for Best Actress in a Musical

values: Edit section: Original casts of notable productions

values: border-collapse: collapse; padding: 0; border: 0; background:transparent; width:100%;

values: Edit section: Original Broadway production

values: background: #FDD; color: black; vertical-align: middle; text-align: center;

values: Tony Award for Best Performance by a Leading Actress in a Musical

values: background: #99FF99; color: black; vertical-align: middle; text-align: center;

values: Tony Award for Best Performance by a Featured Actor in a Musical

values: Tony Award for Best Performance by a Featured Actress in a Musical

values:
/wiki/Elizabeth_Withers
mw-redirect
Elizabeth Withers

values: Grammy Award for Best Musical Show Album

values: Tony Award for Best Featured Actress in a Musical

values: Tony Award for Best Direction of a Musical

values: Drama Desk Award for Outstanding Revival of a Musical

values: Drama Desk Award for Outstanding Actress in a Musical

values: Drama Desk Award for Outstanding Featured Actress in a Musical

values: Drama Desk Award for Outstanding Director of a Musical

values: Drama Desk Award for Outstanding Orchestrations

values: Drama Desk Award for Outstanding Lighting Design for a Musical

values:
/wiki/Today_(NBC_program)
mw-redirect
Today (NBC program)

values:
/wiki/International_Herald_Tribune
mw-redirect
International Herald Tribune

values:
nofollow
external text
http://www.phoenix-ent.com/news.htm

values: -moz-column-width: 30em; -webkit-column-width: 30em; column-width: 30em; list-style-type: decimal;

values:
nofollow
http://www.colorpurple.com/
external text

values: nowraplinks hlist collapsible autocollapse navbox-inner

values: Template:Daytime Emmy Award Outstanding Musical Performance

values: Template talk:Daytime Emmy Award Outstanding Musical Performance

values: nowraplinks collapsible autocollapse navbox-inner

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/The_Color_Purple_(musical)
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Featured content – the best of Wikipedia

values: Find background information on current events

values:
/wiki/Special:Random
Load a random article [ctrl-alt-x]
x

values: portal navigation p-navigation p-navigation-label

values: Guidance on how to use and edit Wikipedia

values: About the project, what you can do, where to find things

values: A list of recent changes in the wiki [ctrl-alt-r]

values: portal navigation p-interaction p-interaction-label

values: List of all English Wikipedia pages containing links to this page [ctrl-alt-j]

values: Recent changes in pages linked from this page [ctrl-alt-k]

values:
/wiki/Wikipedia:File_Upload_Wizard
Upload files [ctrl-alt-u]
u

values: A list of all special pages [ctrl-alt-q]

values:
uls-settings-trigger
Language settings
0
button
true

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-The_Color_Purple_musical rootpage-The_Color_Purple_musical vector-experimental-print-styles vector-nav-directionality skin-vector action-view


text:
Gun laws in Missouri
From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Location of Missouri in the United States
Gun laws in Missouri regulate the sale, possession, and use of firearms and ammunition in the state of Missouri in the United States.[1][2]
Contents
1 Summary table
2 Concealed carry
3 Open carry
4 Concealed Carry Permit Requirement Exceptions
5 References
6 External links
Summary table[edit]
Subject/Law
Long Guns
Handguns
Relevant Statutes
Notes
State permit required to purchase? No No
Firearm registration? No No
Owner license required? No No
Carry permits required ? No No Missouri is a "shall issue" state for concealed carry. Permitless carry took effect on January 1, 2017.[3]
Open carry permitted? Yes Yes Open carry is permitted. As of October 11, 2014, a valid CCW overrides local laws against Open Carry, state wide.
State preemption of local restrictions? Yes Yes Local governments are allowed to regulate open carry and the discharge of firearms (except in self defense); however, ccw permit holders are exempt from ordinances banning open carry.[4]
Assault weapon law? No No
Magazine Capacity Restriction? No No
NFA weapons restricted? No No
Peaceable journey law? Yes Yes
Background checks required for private sales? No No
Concealed carry[edit]
Missouri Statute 571.070 (8/28/2007) says that it is unlawful for a felon or adjudged incompetent Person to have possession of any firearm (including concealable firearms). Violation of this law is a class D felony.[5] This law was the subject of a challenge, in which a nonviolent felon successfully argued that the law is unconstitutional as applied to him. The law failed muster against the required strict scrutiny test.[6][7] However, the law was found to be constitutional by the Supreme Court of Missouri.[8]
Missouri law exempts the possession of antique firearms, as defined in 18 U.S.C. Section 921, from the provision that specifies a person commits the crime of unlawful possession of a firearm if he or she is a convicted felon possessing a firearm.[5]
Missouri Statute 571.121 (8/28/2007) says that: (a) You have to carry your permit with you when you carry the concealed weapon, and if you don't have it with you, it is not a crime, but you can be fined up to $35; and that (b) County sheriffs issue a state CCW I.D. that reflects that you can carry concealed.[9]
In September 2014, Missouri lawmakers passed SB 656 allowing specially trained school employees to carry concealed guns on campuses. It also allows anyone with a concealed weapons permit to carry guns openly in cities or towns with bans against the open carrying of firearms. The age to obtain a concealed weapons permit was also dropped from 21 to 19 [See 2014 Senate Bill 656]. Missouri became the 10th state to pass legislation allowing armed school employees since the mass shooting at Sandy Hook Elementary School in Newtown, Connecticut, in 2012.[10] The bill was initially vetoed by Gov. Nixon, but the Missouri legislature overrode the veto during the September veto session.[11]
In September 2016, another Senate bill coincidentally numbered SB 656 was passed allowing permitless concealed carry by anyone 19[12][13] years of age or older who may lawfully own a gun. This bill was also vetoed by Governor Nixon, on June 27, 2016. After the Missouri legislature reconvened for the veto-override session on September 14, 2016, the Senate voted to override the veto with a 24 – 6 vote (23 required) and the House followed through shortly thereafter with a 112 – 41 vote (109 required). The permitless carry provision of the bill went into effect on January 1, 2017.[3]
Open carry[edit]
Missouri allows any person who has a valid concealed carry endorsement or permit and is lawfully carrying a firearm in a concealed manner to briefly and openly display the firearm, so long as the firearm is not displayed in an angry or threatening manner.[14] Some localities prohibit open carry; however, concealed carry license holders are exempted from this restriction.[15]
Concealed Carry Permit Requirement Exceptions[edit]
As of January 1, 2017, a permit is not required to carry concealed.[3]
References[edit]
Jump up ^ "State Gun Laws: Missouri", National Rifle Association – Institute for Legislative Action. Retrieved December 30, 2012.
Jump up ^ "Missouri State Law Summary", Law Center to Prevent Gun Violence. Retrieved December 30, 2012.
^ Jump up to: a b c NRA-ILA. "NRA-ILA | Missourians Celebrate a Win for Self-Defense Rights on Wednesday". Retrieved 2016-09-15.
Jump up ^ http://moga.mo.gov/mostatutes/stathtml/02100007501.html, Missouri Revised Statutes, 21.750 Firearms legislation preemption by general assembly, exceptions--limitation on civil recovery against firearms or ammunitions manufacturers, when, exception.
^ Jump up to: a b http://www.moga.mo.gov/mostatutes/stathtml/57100000701.html, Missouri Revised Statutes, 571.070 Possession of firearm unlawful for certain persons--penalty--exception.
Jump up ^ http://www.stltoday.com/news/local/crime-and-courts/st-louis-judge-tosses-out-gun-case-citing-newly-enacted/article_59c7444f-1f6a-5ac7-aa5c-ec8bf4af09a0.html
Jump up ^ https://www.documentcloud.org/documents/1678155-robinsonmotion.html
Jump up ^ Mann, Jennifer S. "Missouri Supreme Court says Amendment 5 did not extend gun rights to non-violent felons". stltoday.com. Retrieved 2016-03-15.
Jump up ^ http://www.moga.mo.gov/mostatutes/stathtml/57100001211.html, Missouri Revised Statutes, 571.121 Duty to carry and display endorsement, penalty for violation--director of revenue immunity from liability, when.
Jump up ^ Ballentine, Summer. "Missouri lawmakers expand gun rights in schools". Washington Times. Retrieved 12 September 2014.
Jump up ^ Bergquist, Garrett. "State Senate overrides gun bill veto". Retrieved 19 September 2014.
Jump up ^ https://www.nraila.org/gun-laws/state-gun-laws/missouri/
Jump up ^ http://handgunlaw.us/states/missouri.pdf
Jump up ^ "Section 571.037 RSMo". Missouri Revised Statutes. August 28, 2014. Retrieved 9 June 2015.
Jump up ^ "Section 21.750 RSMo". Missouri Revised Statutes. August 28, 2014. Retrieved 9 June 2015.
External links[edit]
Chapter 571 - Weapons Offenses of Missouri Revised Statutes
hide
v
t
e
Gun laws in the United States by state
Alabama
Alaska
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
Florida
Georgia
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Maryland
Massachusetts
Michigan
Minnesota
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Ohio
Oklahoma
Oregon
Pennsylvania
Rhode Island
South Carolina
South Dakota
Tennessee
Texas
Utah
Vermont
Virginia
Washington
West Virginia
Wisconsin
Wyoming
District of Columbia
American Samoa
Guam
Northern Mariana Islands
Puerto Rico
U.S. Virgin Islands
Retrieved from "https://en.wikipedia.org/w/index.php?title=Gun_laws_in_Missouri&oldid=846361883"
Categories:
Missouri law
United States gun laws by state
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
Add links
This page was last edited on 18 June 2018, at 08:09 (UTC).
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

key: html

type: local

value: div

attrs: id class

values: mw-page-base noprint

values: mw-head-base noprint

value: a

attrs: id class lang

values: firstHeading firstHeading en

values: siteSub noprint

attrs: class href

values: mw-jump-link #mw-head

values: mw-jump-link #p-search

value: img

attrs: alt src width height class srcset data-file-width data-file-height

attrs: href class

attrs: class style

value: b

attrs: href title

value: sup

value: p

value: input

attrs: type role id class style

values: checkbox button toctogglecheckbox toctogglecheckbox display:none

values: Edit section: Concealed Carry Permit Requirement Exceptions

values: Template:Gun laws in the United States by state

values: Template talk:Gun laws in the United States by state

values: Gun laws in the Northern Mariana Islands

values: Gun laws in the United States Virgin Islands

values: nowraplinks collapsible uncollapsed navbox-inner mw-collapsible mw-made-collapsible

values: Category:United States gun laws by state

values:
catlinks mw-normal-catlinks
catlinks mw-normal-catlinks
interface

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/Gun_laws_in_Missouri
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values: Permanent link to this revision of the page

values: Link to connected data repository item [ctrl-alt-g]

values: Printable version of this page [ctrl-alt-p]

values: /static/images/wikimedia-button-1.5x.png 1.5x, /static/images/wikimedia-button-2x.png 2x

values: /static/images/poweredby_mediawiki_132x47.png 1.5x, /static/images/poweredby_mediawiki_176x62.png 2x

values:
suggestions
display: none; font-size: 13px;

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Gun_laws_in_Missouri rootpage-Gun_laws_in_Missouri skin-vector action-view


text:
Minimum spanning tree
From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
A planar graph and its minimum spanning tree. Each edge is labeled with its weight, which here is roughly proportional to its length.
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.
There are quite a few use cases for minimum spanning trees. One example would be a telecommunications company trying to lay cable in a new neighborhood. If it is constrained to bury the cable only along certain paths (e.g. roads), then there would be a graph containing the points (e.g. houses) connected by those paths. Some of the paths might be more expensive, because they are longer, or require the cable to be buried deeper; these paths would be represented by edges with larger weights. Currency is an acceptable unit for edge weight – there is no requirement for edge lengths to obey normal rules of geometry such as the triangle inequality. A spanning tree for that graph would be a subset of those paths that has no cycles but still connects every house; there might be several spanning trees possible. A minimum spanning tree would be one with the lowest total cost, representing the least expensive path for laying the cable.
Contents
[hide]
1 Properties
1.1 Possible multiplicity
1.2 Uniqueness
1.3 Minimum-cost subgraph
1.4 Cycle property
1.5 Cut property
1.6 Minimum-cost edge
1.7 Contraction
2 Algorithms
2.1 Classic algorithms
2.2 Faster algorithms
2.3 Linear-time algorithms in special cases
2.3.1 Dense graphs
2.3.2 Integer weights
2.4 Decision trees
2.5 Optimal algorithm
2.6 Parallel and distributed algorithms
3 MST on complete graphs
4 Applications
5 Related problems
6 References
7 Further reading
8 External links
Properties[edit]
Possible multiplicity[edit]
If there are n vertices in the graph, then each spanning tree has n − 1 edges.
This figure shows there may be more than one minimum spanning tree in a graph. In the figure, the two trees below the graph are two possibilities of minimum spanning tree of the given graph.
There may be several minimum spanning trees of the same weight; in particular, if all the edge weights of a given graph are the same, then every spanning tree of that graph is minimum.
Uniqueness[edit]
If each edge has a distinct weight then there will be only one, unique minimum spanning tree. This is true in many realistic situations, such as the telecommunications company example above, where it's unlikely any two paths have exactly the same cost. This generalizes to spanning forests as well.
Proof:
Assume the contrary, that there are two different MSTs A and B.
Since A and B differ despite containing the same nodes, there is at least one edge that belongs to one but not the other. Among such edges, let e1 be the one with least weight; this choice is unique because the edge weights are all distinct. Without loss of generality, assume e1 is in A.
As B is a MST, {e1} ∪ {\displaystyle \cup } B must contain a cycle C.
As a tree, A contains no cycles, therefore C must have an edge e2 that is not in A.
Since e1 was chosen as the unique lowest-weight edge among those belonging to exactly one of A and B, the weight of e2 must be greater than the weight of e1.
Replacing e2 with e1 in B therefore yields a spanning tree with a smaller weight.
This contradicts the assumption that B is a MST.
More generally, if the edge weights are not all distinct then only the (multi-)set of weights in minimum spanning trees is certain to be unique; it is the same for all minimum spanning trees.[1]
Minimum-cost subgraph[edit]
If the weights are positive, then a minimum spanning tree is in fact a minimum-cost subgraph connecting all vertices, since subgraphs containing cycles necessarily have more total weight.
Cycle property[edit]
For any cycle C in the graph, if the weight of an edge e of C is larger than the individual weights of all other edges of C, then this edge cannot belong to a MST.
Proof: Assume the contrary, i.e. that e belongs to an MST T1. Then deleting e will break T1 into two subtrees with the two ends of e in different subtrees. The remainder of C reconnects the subtrees, hence there is an edge f of C with ends in different subtrees, i.e., it reconnects the subtrees into a tree T2 with weight less than that of T1, because the weight of f is less than the weight of e.
Cut property[edit]
This figure shows the cut property of MSTs. T is the only MST of the given graph. If S = {A,B,D,E}, thus V-S = {C,F}, then there are 3 possibilities of the edge across the cut(S,V-S), they are edges BC, EC, EF of the original graph. Then, e is one of the minimum-weight-edge for the cut, therefore S ∪ {e} is part of the MST T.
For any cut C of the graph, if the weight of an edge e in the cut-set of C is strictly smaller than the weights of all other edges of the cut-set of C, then this edge belongs to all MSTs of the graph.
Proof: Assume that there is a MST T that does not contain e. Adding e to T will produce a cycle, that crosses the cut once at e and crosses back at another edge e' . Deleting e' we get a spanning tree T\{e'}U{e} of strictly smaller weight than T. This contradicts the assumption that T was a MST.
By a similar argument, if more than one edge is of minimum weight across a cut, then each such edge is contained in some minimum spanning tree.
Minimum-cost edge[edit]
If the minimum cost edge e of a graph is unique, then this edge is included in any MST.
Proof: if e was not included in the MST, removing any of the (larger cost) edges in the cycle formed after adding e to the MST, would yield a spanning tree of smaller weight.
Contraction[edit]
If T is a tree of MST edges, then we can contract T into a single vertex while maintaining the invariant that the MST of the contracted graph plus T gives the MST for the graph before contraction.[2]
Algorithms[edit]
In all of the algorithms below, m is the number of edges in the graph and n is the number of vertices.
Classic algorithms[edit]
The first algorithm for finding a minimum spanning tree was developed by Czech scientist Otakar Borůvka in 1926 (see Borůvka's algorithm). Its purpose was an efficient electrical coverage of Moravia. The algorithm proceeds in a sequence of stages. In each stage, called Boruvka step, it identifies a forest F consisting of the minimum-weight edge incident to each vertex in the graph G, then forms the graph G 1 = G ∖ F {\displaystyle G_{1}=G\setminus F} as the input to the next step. Here G ∖ F {\displaystyle G\setminus F} denotes the graph derived from G by contracting edges in F (by the Cut property, these edges belong to the MST). Each Boruvka step takes linear time. Since the number of vertices is reduced by at least half in each step, Boruvka's algorithm takes O(m log n) time.[2]
A second algorithm is Prim's algorithm, which was invented by Jarnik in 1930 and rediscovered by Prim in 1957 and Dijkstra in 1959. Basically, it grows the MST (T) one edge at a time. Initially, T contains an arbitrary vertex. In each step, T is augmented with a least-weight edge (x,y) such that x is in T and y is not yet in T. By the Cut property, all edges added to T are in the MST. Its run-time is either O(m log n) or O(m + n log n), depending on the data-structures used.
A third algorithm commonly in use is Kruskal's algorithm, which also takes O(m log n) time.
A fourth algorithm, not as commonly used, is the reverse-delete algorithm, which is the reverse of Kruskal's algorithm. Its runtime is O(m log n (log log n)3).
All these four are greedy algorithms. Since they run in polynomial time, the problem of finding such trees is in FP, and related decision problems such as determining whether a particular edge is in the MST or determining if the minimum total weight exceeds a certain value are in P.
Faster algorithms[edit]
Several researchers have tried to find more computationally-efficient algorithms.
In a comparison model, in which the only allowed operations on edge weights are pairwise comparisons, Karger, Klein & Tarjan (1995) found a linear time randomized algorithm based on a combination of Borůvka's algorithm and the reverse-delete algorithm.[3][4]
The fastest non-randomized comparison-based algorithm with known complexity, by Bernard Chazelle, is based on the soft heap, an approximate priority queue.[5][6] Its running time is O(m α(m,n)), where α is the classical functional inverse of the Ackermann function. The function α grows extremely slowly, so that for all practical purposes it may be considered a constant no greater than 4; thus Chazelle's algorithm takes very close to linear time.
Linear-time algorithms in special cases[edit]
Dense graphs[edit]
If the graph is dense (i.e. m/n ≥ log log log n), then a deterministic algorithm by Fredman and Tarjan finds the MST in time O(m).[7] The algorithm executes a number of phases. Each phase executes Prim's algorithm many times, each for a limited number of steps. The run-time of each phase is O(m+n). If the number of vertices before a phase is n ′ {\displaystyle n'} , the number of vertices remaining after a phase is at most n ′ / 2 m / n ′ {\displaystyle n'/2^{m/n'}} . Hence, at most log ∗  n {\displaystyle \log ^{*}{n}} phases are needed, which gives a linear run-time for dense graphs.[2]
There are other algorithms that work in linear time on dense graphs.[5][8]
Integer weights[edit]
If the edge weights are integers represented in binary, then deterministic algorithms are known that solve the problem in O(m + n) integer operations.[9] Whether the problem can be solved deterministically for a general graph in linear time by a comparison-based algorithm remains an open question.
Decision trees[edit]
Given graph G where the nodes and edges are fixed but the weights are unknown, it is possible to construct a binary decision tree (DT) for calculating the MST for any permutation of weights. Each internal node of the DT contains a comparison between two edges, e.g. "Is the weight of the edge between x and y larger than the weight of the edge between w and z?". The two children of the node correspond to the two possible answers "yes" or "no". In each leaf of the DT, there is a list of edges from G that correspond to an MST. The runtime complexity of a DT is the largest number of queries required to find the MST, which is just the depth of the DT. A DT for a graph G is called optimal if it has the smallest depth of all correct DTs for G.
For every integer r, it is possible to find optimal decision trees for all graphs on r vertices by brute-force search. This search proceeds in two steps.
A. Generating all potential DTs
There are 2 ( r 2 ) {\displaystyle 2^{r \choose 2}} different graphs on r vertices.
For each graph, an MST can always be found using r(r-1) comparisons, e.g. by Prim's algorithm.
Hence, the depth of an optimal DT is less than r 2 {\displaystyle r^{2}} .
Hence, the number of internal nodes in an optimal DT is less than 2 r 2 {\displaystyle 2^{r^{2}}} .
Every internal node compares two edges. The number of edges is at most r 2 {\displaystyle r^{2}} so the different number of comparisons is at most r 4 {\displaystyle r^{4}} .
Hence, the number of potential DTs is less than: ( r 4 ) ( 2 r 2 ) = r 2 ( r 2 + 2 ) {\displaystyle {(r^{4})}^{(2^{r^{2}})}=r^{2^{(r^{2}+2)}}} .
B. Identifying the correct DTs To check if a DT is correct, it should be checked on all possible permutations of the edge weights.
The number of such permutations is at most ( r 2 ) ! {\displaystyle (r^{2})!} .
For each permutation, solve the MST problem on the given graph using any existing algorithm, and compare the result to the answer given by the DT.
The running time of any MST algorithm is at most ( r 2 ) {\displaystyle (r^{2})} , so the total time required to check all permutations is at most ( r 2 + 1 ) ! {\displaystyle (r^{2}+1)!} .
Hence, the total time required for finding an optimal DT for all graphs with r vertices is: 2 ( r 2 ) ⋅ r 2 ( r 2 + 2 ) ⋅ ( r 2 + 1 ) ! {\displaystyle 2^{r \choose 2}\cdot r^{2^{(r^{2}+2)}}\cdot (r^{2}+1)!} , which is less than: 2 2 r 2 + o ( r ) {\displaystyle 2^{2^{r^{2}+o(r)}}} .[2]
See also: Decision tree model
Optimal algorithm[edit]
Seth Pettie and Vijaya Ramachandran have found a provably optimal deterministic comparison-based minimum spanning tree algorithm.[2] The following is a simplified description of the algorithm.
Let r = log  log  log  n {\displaystyle r=\log \log \log n} , where n is the number of vertices. Find all optimal decision trees on r vertices. This can be done in time O(n) (see Decision trees above).
Partition the graph to components with at most r vertices in each component. This partition can be done in time O(m).
Use the optimal decision trees to find an MST for each component.
Contract each connected component spanned by the MSTs to a single vertex.
It is possible to prove that the resulting graph has at most n/r vertices. Hence, the graph is dense and we can use any algorithm which works on Dense graphs in time O(m).
The runtime of all steps in the algorithm is O(m), except for the step of using the decision trees. We don't know the runtime of this step, but we know that it is optimal - no algorithm can do better than the optimal decision tree.
Thus, this algorithm has the peculiar property that it is provably optimal although its runtime complexity is unknown.
Parallel and distributed algorithms[edit]
Research has also considered parallel algorithms for the minimum spanning tree problem. With a linear number of processors it is possible to solve the problem in O ( log  n ) {\displaystyle O(\log n)} time.[10][11] Bader & Cong (2006) demonstrate an algorithm that can compute MSTs 5 times faster on 8 processors than an optimized sequential algorithm.[12]
Other specialized algorithms have been designed for computing minimum spanning trees of a graph so large that most of it must be stored on disk at all times. These external storage algorithms, for example as described in "Engineering an External Memory Minimum Spanning Tree Algorithm" by Roman, Dementiev et al.,[13] can operate, by authors' claims, as little as 2 to 5 times slower than a traditional in-memory algorithm. They rely on efficient external storage sorting algorithms and on graph contraction techniques for reducing the graph's size efficiently.
The problem can also be approached in a distributed manner. If each node is considered a computer and no node knows anything except its own connected links, one can still calculate the distributed minimum spanning tree.
MST on complete graphs[edit]
Alan M. Frieze showed that given a complete graph on n vertices, with edge weights that are independent identically distributed random variables with distribution function F {\displaystyle F} satisfying F ′ ( 0 ) > 0 {\displaystyle F'(0)>0} , then as n approaches +∞ the expected weight of the MST approaches ζ ( 3 ) / F ′ ( 0 ) {\displaystyle \zeta (3)/F'(0)} , where ζ {\displaystyle \zeta } is the Riemann zeta function. Frieze and Steele also proved convergence in probability. Svante Janson proved a central limit theorem for weight of the MST.
For uniform random weights in [ 0 , 1 ] {\displaystyle [0,1]} , the exact expected size of the minimum spanning tree has been computed for small complete graphs.[14]
Vertices
Expected size
Approximate expected size
2 1 / 2 0.5
3 3 / 4 0.75
4 31 / 35 0.8857143
5 893 / 924 0.9664502
6 278 / 273 1.0183151
7 30739 / 29172 1.053716
8 199462271 / 184848378 1.0790588
9 126510063932 / 115228853025 1.0979027
Applications[edit]
Minimum spanning trees have direct applications in the design of networks, including computer networks, telecommunications networks, transportation networks, water supply networks, and electrical grids (which they were first invented for, as mentioned above).[15] They are invoked as subroutines in algorithms for other problems, including the Christofides algorithm for approximating the traveling salesman problem,[16] approximating the multi-terminal minimum cut problem (which is equivalent in the single-terminal case to the maximum flow problem),[17] and approximating the minimum-cost weighted perfect matching.[18]
Other practical applications based on minimal spanning trees include:
Taxonomy.[19]
Cluster analysis: clustering points in the plane,[20] single-linkage clustering (a method of hierarchical clustering),[21] graph-theoretic clustering,[22] and clustering gene expression data.[23]
Constructing trees for broadcasting in computer networks.[24]
Image registration[25] and segmentation[26] – see minimum spanning tree-based segmentation.
Curvilinear feature extraction in computer vision.[27]
Handwriting recognition of mathematical expressions.[28]
Circuit design: implementing efficient multiple constant multiplications, as used in finite impulse response filters.[29]
Regionalisation of socio-geographic areas, the grouping of areas into homogeneous, contiguous regions.[30]
Comparing ecotoxicology data.[31]
Topological observability in power systems.[32]
Measuring homogeneity of two-dimensional materials.[33]
Minimax process control.[34]
Minimum spanning trees can also be used to describe financial markets.[35][36] A correlation matrix can be created by calculating a coefficient of correlation between any two stocks. This matrix can be represented topologically as a complex network and a minimum spanning tree can be constructed to visualize relationships.
Related problems[edit]
The problem of finding the Steiner tree of a subset of the vertices, that is, minimum tree that spans the given subset, is known to be NP-Complete.[37]
A related problem is the k-minimum spanning tree (k-MST), which is the tree that spans some subset of k vertices in the graph with minimum weight.
A set of k-smallest spanning trees is a subset of k spanning trees (out of all possible spanning trees) such that no spanning tree outside the subset has smaller weight.[38][39][40] (Note that this problem is unrelated to the k-minimum spanning tree.)
The Euclidean minimum spanning tree is a spanning tree of a graph with edge weights corresponding to the Euclidean distance between vertices which are points in the plane (or space).
The rectilinear minimum spanning tree is a spanning tree of a graph with edge weights corresponding to the rectilinear distance between vertices which are points in the plane (or space).
In the distributed model, where each node is considered a computer and no node knows anything except its own connected links, one can consider distributed minimum spanning tree. The mathematical definition of the problem is the same but there are different approaches for a solution.
The capacitated minimum spanning tree is a tree that has a marked node (origin, or root) and each of the subtrees attached to the node contains no more than a c nodes. c is called a tree capacity. Solving CMST optimally is NP-hard,[41] but good heuristics such as Esau-Williams and Sharma produce solutions close to optimal in polynomial time.
The degree constrained minimum spanning tree is a minimum spanning tree in which each vertex is connected to no more than d other vertices, for some given number d. The case d = 2 is a special case of the traveling salesman problem, so the degree constrained minimum spanning tree is NP-hard in general.
For directed graphs, the minimum spanning tree problem is called the Arborescence problem and can be solved in quadratic time using the Chu–Liu/Edmonds algorithm.
A maximum spanning tree is a spanning tree with weight greater than or equal to the weight of every other spanning tree. Such a tree can be found with algorithms such as Prim's or Kruskal's after multiplying the edge weights by -1 and solving the MST problem on the new graph. A path in the maximum spanning tree is the widest path in the graph between its two endpoints: among all possible paths, it maximizes the weight of the minimum-weight edge.[42] Maximum spanning trees find applications in parsing algorithms for natural languages[43] and in training algorithms for conditional random fields.
The dynamic MST problem concerns the update of a previously computed MST after an edge weight change in the original graph or the insertion/deletion of a vertex.[44][45][46]
The minimum labeling spanning tree problem is to find a spanning tree with least types of labels if each edge in a graph is associated with a label from a finite label set instead of a weight.[47]
A bottleneck edge is the highest weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree (or MBST) if the graph does not contain a spanning tree with a smaller bottleneck edge weight. A MST is necessarily a MBST (provable by the cut property), but a MBST is not necessarily a MST.[48][49]
References[edit]
Jump up ^ "Do the minimum spanning trees of a weighted graph have the same number of edges with a given weight?". cs.stackexchange.com. Retrieved 4 April 2018.
^ Jump up to: a b c d e Pettie, Seth; Ramachandran, Vijaya (2002), "An optimal minimum spanning tree algorithm", Journal of the Association for Computing Machinery, 49 (1): 16–34, doi:10.1145/505241.505243, MR 2148431 .
Jump up ^ Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), "A randomized linear-time algorithm to find minimum spanning trees", Journal of the Association for Computing Machinery, 42 (2): 321–328, doi:10.1145/201019.201022, MR 1409738
Jump up ^ Pettie, Seth; Ramachandran, Vijaya (2002), "Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco, California, pp. 713–722 .
^ Jump up to: a b Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–1047, doi:10.1145/355541.355562, MR 1866456 .
Jump up ^ Chazelle, Bernard (2000), "The soft heap: an approximate priority queue with optimal error rate" (PDF), Journal of the Association for Computing Machinery, 47 (6): 1012–1027, doi:10.1145/355541.355554, MR 1866455 .
Jump up ^ Fredman, M. L.; Tarjan, R. E. (1987). "Fibonacci heaps and their uses in improved network optimization algorithms". Journal of the ACM. 34 (3): 596. doi:10.1145/28869.28874.
Jump up ^ Gabow, H. N.; Galil, Z.; Spencer, T.; Tarjan, R. E. (1986). "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs". Combinatorica. 6 (2): 109. doi:10.1007/bf02579168.
Jump up ^ Fredman, M. L.; Willard, D. E. (1994), "Trans-dichotomous algorithms for minimum spanning trees and shortest paths", Journal of Computer and System Sciences, 48 (3): 533–551, doi:10.1016/S0022-0000(05)80064-9, MR 1279413 .
Jump up ^ Chong, Ka Wong; Han, Yijie; Lam, Tak Wah (2001), "Concurrent threads and optimal parallel minimum spanning trees algorithm", Journal of the Association for Computing Machinery, 48 (2): 297–323, doi:10.1145/375827.375847, MR 1868718 .
Jump up ^ Pettie, Seth; Ramachandran, Vijaya (2002), "A randomized time-work optimal parallel algorithm for finding a minimum spanning forest" (PDF), SIAM Journal on Computing, 31 (6): 1879–1895, doi:10.1137/S0097539700371065, MR 1954882 .
Jump up ^ Bader, David A.; Cong, Guojing (2006), "Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs", Journal of Parallel and Distributed Computing, 66 (11): 1366–1378, doi:10.1016/j.jpdc.2006.06.001 .
Jump up ^ Dementiev, Roman; Sanders, Peter; Schultes, Dominik; Sibeyn, Jop F. (2004), "Engineering an external memory minimum spanning tree algorithm", Proc. IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004) (PDF), pp. 195–208 .
Jump up ^ Steele, J. Michael (2002), "Minimal spanning trees for graphs with random edge lengths", Mathematics and computer science, II (Versailles, 2002), Trends Math., Basel: Birkhäuser, pp. 223–245, MR 1940139
Jump up ^ Graham, R. L.; Hell, Pavol (1985), "On the history of the minimum spanning tree problem", Annals of the History of Computing, 7 (1): 43–57, doi:10.1109/MAHC.1985.10011, MR 0783327
Jump up ^ Nicos Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Administration, CMU, 1976.
Jump up ^ Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (August 1994). "The complexity of multiterminal cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. Archived from the original (PDF) on 24 August 2004. Retrieved 17 December 2012.
Jump up ^ Supowit, Kenneth J.; Plaisted, David A.; Reingold, Edward M. (1980). Heuristics for weighted perfect matching. 12th Annual ACM Symposium on Theory of Computing (STOC '80). New York, NY, USA: ACM. pp. 398–419. doi:10.1145/800141.804689.
Jump up ^ Sneath, P. H. A. (1 August 1957). "The Application of Computers to Taxonomy". Journal of General Microbiology. 17 (1): 201–226. doi:10.1099/00221287-17-1-201. PMID 13475686.
Jump up ^ Asano, T.; Bhattacharya, B.; Keil, M.; Yao, F. (1988). Clustering algorithms based on minimum and maximum spanning trees. Fourth Annual Symposium on Computational Geometry (SCG '88). 1. pp. 252–257. doi:10.1145/73393.73419.
Jump up ^ Gower, J. C.; Ross, G. J. S. (1969). "Minimum Spanning Trees and Single Linkage Cluster Analysis". Journal of the Royal Statistical Society. C (Applied Statistics). 18 (1): 54–64. doi:10.2307/2346439.
Jump up ^ Päivinen, Niina (1 May 2005). "Clustering with a minimum spanning tree of scale-free-like structure". Pattern Recognition Letters. 26 (7): 921–930. doi:10.1016/j.patrec.2004.09.039.
Jump up ^ Xu, Y.; Olman, V.; Xu, D. (1 April 2002). "Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees". Bioinformatics. 18 (4): 536–545. doi:10.1093/bioinformatics/18.4.536. PMID 12016051.
Jump up ^ Dalal, Yogen K.; Metcalfe, Robert M. (1 December 1978). "Reverse path forwarding of broadcast packets". Communications of the ACM. 21 (12): 1040–1048. doi:10.1145/359657.359665.
Jump up ^ Ma, B.; Hero, A.; Gorman, J.; Michel, O. (2000). Image registration with minimum spanning tree algorithm (PDF). International Conference on Image Processing. 1. pp. 481–484. doi:10.1109/ICIP.2000.901000.
Jump up ^ P. Felzenszwalb, D. Huttenlocher: Efficient Graph-Based Image Segmentation. IJCV 59(2) (September 2004)
Jump up ^ Suk, Minsoo; Song, Ohyoung (1 June 1984). "Curvilinear feature extraction using minimum spanning trees". Computer Vision, Graphics, and Image Processing. 26 (3): 400–411. doi:10.1016/0734-189X(84)90221-4.
Jump up ^ Tapia, Ernesto; Rojas, Raúl (2004). "Recognition of On-line Handwritten Mathematical Expressions Using a Minimum Spanning Tree Construction and Symbol Dominance". Graphics Recognition. Recent Advances and Perspectives (PDF). Lecture Notes in Computer Science. 3088. Berlin Heidelberg: Springer-Verlag. pp. 329–340. ISBN 3540224785.
Jump up ^ Ohlsson, H. (2004). Implementation of low complexity FIR filters using a minimum spanning tree. 12th IEEE Mediterranean Electrotechnical Conference (MELECON 2004). 1. pp. 261–264. doi:10.1109/MELCON.2004.1346826.
Jump up ^ AssunÇão, R. M.; M. C. Neves; G. Câmara; C. Da Costa Freitas (2006). "Efficient regionalization techniques for socio‐economic geographical units using minimum spanning trees". International Journal of Geographical Information Science. 20 (7): 797–811. doi:10.1080/13658810600665111.
Jump up ^ Devillers, J.; Dore, J.C. (1 April 1989). "Heuristic potency of the minimum spanning tree (MST) method in toxicology". Ecotoxicology and Environmental Safety. 17 (2): 227–235. doi:10.1016/0147-6513(89)90042-0. PMID 2737116.
Jump up ^ Mori, H.; Tsuzuki, S. (1 May 1991). "A fast method for topological observability analysis using a minimum spanning tree technique". IEEE Transactions on Power Systems. 6 (2): 491–500. doi:10.1109/59.76691.
Jump up ^ Filliben, James J.; Kafadar, Karen; Shier, Douglas R. (1 January 1983). "Testing for homogeneity of two-dimensional surfaces". Mathematical Modelling. 4 (2): 167–189. doi:10.1016/0270-0255(83)90026-X.
Jump up ^ Kalaba, Robert E. (1963), Graph Theory and Automatic Control (PDF)
Jump up ^ Mantegna, R. N. (1999). Hierarchical structure in financial markets. The European Physical Journal B-Condensed Matter and Complex Systems, 11(1), 193-197.
Jump up ^ Djauhari, M., & Gan, S. (2015). Optimality problem of network topology in stocks market analysis. Physica A: Statistical Mechanics and Its Applications, 419, 108-114.
Jump up ^ Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, ISBN 0-7167-1045-5 . ND12
Jump up ^ Gabow, Harold N. (1977), "Two algorithms for generating weighted spanning trees in order", SIAM Journal on Computing, 6 (1): 139–150, doi:10.1137/0206011, MR 0441784 .
Jump up ^ Eppstein, David (1992), "Finding the k smallest spanning trees", BIT, 32 (2): 237–248, doi:10.1007/BF01994879, MR 1172188 .
Jump up ^ Frederickson, Greg N. (1997), "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees", SIAM Journal on Computing, 26 (2): 484–538, doi:10.1137/S0097539792226825, MR 1438526 .
Jump up ^ Jothi, Raja; Raghavachari, Balaji (2005), "Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design", ACM Trans. Algorithms, 1 (2): 265–282, doi:10.1145/1103963.1103967
Jump up ^ Hu, T. C. (1961), "The maximum capacity route problem", Operations Research, 9 (6): 898–900, doi:10.1287/opre.9.6.898, JSTOR 167055 .
Jump up ^ McDonald, Ryan; Pereira, Fernando; Ribarov, Kiril; Hajič, Jan (2005). "Non-projective dependency parsing using spanning tree algorithms" (PDF). Proc. HLT/EMNLP.
Jump up ^ Spira, P. M.; Pan, A. (1975), "On finding and updating spanning trees and shortest paths" (PDF), SIAM Journal on Computing, 4 (3): 375–380, doi:10.1137/0204032, MR 0378466 .
Jump up ^ Holm, Jacob; de Lichtenberg, Kristian; Thorup, Mikkel (2001), "Poly-logarithmic deterministic fully dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity", Journal of the Association for Computing Machinery, 48 (4): 723–760, doi:10.1145/502090.502095, MR 2144928 .
Jump up ^ Chin, F.; Houck, D. (1978), "Algorithms for updating minimal spanning trees", Journal of Computer and System Sciences, 16 (3): 333–344, doi:10.1016/0022-0000(78)90022-3 .
Jump up ^ Chang, R.S.; Leu, S.J. (1997), "The minimum labeling spanning trees", Information Processing Letters, 63 (5): 277–282, doi:10.1016/s0020-0190(97)00127-0 .
Jump up ^ "Everything about Bottleneck Spanning Tree". flashing-thoughts.blogspot.ru. Retrieved 4 April 2018.
Jump up ^ http://pages.cpsc.ucalgary.ca/~dcatalin/413/t4.pdf
Further reading[edit]
Otakar Boruvka on Minimum Spanning Tree Problem (translation of the both 1926 papers, comments, history) (2000) Jaroslav Nešetřil, Eva Milková, Helena Nesetrilová. (Section 7 gives his algorithm, which looks like a cross between Prim's and Kruskal's.)
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Chapter 23: Minimum Spanning Trees, pp. 561–579.
Eisner, Jason (1997). State-of-the-art algorithms for minimum spanning trees: A tutorial discussion. Manuscript, University of Pennsylvania, April. 78 pp.
Kromkowski, John David. "Still Unmelted after All These Years", in Annual Editions, Race and Ethnic Relations, 17/e (2009 McGraw Hill) (Using minimum spanning tree as method of demographic analysis of ethnic diversity across the United States).
External links[edit]
Wikimedia Commons has media related to Minimum spanning trees.
Implemented in BGL, the Boost Graph Library
The Stony Brook Algorithm Repository - Minimum Spanning Tree codes
Implemented in QuickGraph for .Net
Retrieved from "https://en.wikipedia.org/w/index.php?title=Minimum_spanning_tree&oldid=845161708"
Categories:
Spanning tree
Polynomial-time problems
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
In other projects
Wikimedia Commons
Languages
Ελληνικά
Español
Esperanto
فارسی
Français
Հայերեն
Italiano
עברית
Magyar
Nederlands
Polski
Português
Русский
Simple English
Slovenčina
Slovenščina
Српски / srpski
Svenska
ไทย
Українська
اردو
Tiếng Việt
中文
14 more
Edit links
This page was last edited on 9 June 2018, at 21:05 (UTC).
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

values: mw-page-base noprint

values: mw-head-base noprint

values: firstHeading firstHeading en

values: siteSub noprint

values: mw-jump-link #mw-head

values: mw-jump-link #p-search

values:
/wiki/Connected_graph
mw-redirect
Connected graph

values: vertical-align: -0.338ex; width:1.55ex; height:2.009ex;

values: vertical-align: -0.838ex; width:11.742ex; height:2.843ex;

values: vertical-align: -0.838ex; width:5.762ex; height:2.843ex;

values: Edit section: Linear-time algorithms in special cases

values: vertical-align: -0.338ex; width:2.079ex; height:2.509ex;

values: vertical-align: -0.838ex; width:8.419ex; height:3.343ex;

values: vertical-align: -0.671ex; width:5.808ex; height:2.676ex;

values: vertical-align: -0.338ex; width:4.025ex; height:3.843ex;

values: vertical-align: -0.338ex; width:2.103ex; height:2.676ex;

values: vertical-align: -0.338ex; width:2.968ex; height:3.009ex;

values: vertical-align: -0.838ex; width:17.325ex; height:4.509ex;

values: vertical-align: -0.838ex; width:4.559ex; height:3.176ex;

values: vertical-align: -0.838ex; width:3.912ex; height:3.176ex;

values: vertical-align: -0.838ex; width:8.562ex; height:3.176ex;

values: vertical-align: -0.838ex; width:22.358ex; height:4.343ex;

values: vertical-align: -0.338ex; width:7.11ex; height:3.509ex;

values: vertical-align: -0.671ex; width:15.618ex; height:2.509ex;

values: Edit section: Parallel and distributed algorithms

values: vertical-align: -0.838ex; width:8.336ex; height:2.843ex;

values:
/wiki/Graph_contraction
mw-redirect
Graph contraction

values: vertical-align: -0.338ex; width:1.741ex; height:2.176ex;

values: vertical-align: -0.838ex; width:9.732ex; height:3.009ex;

values: vertical-align: -0.838ex; width:10.701ex; height:3.009ex;

values: vertical-align: -0.671ex; width:1.095ex; height:2.509ex;

values: vertical-align: -0.838ex; width:4.653ex; height:2.843ex;

values:
/wiki/Traveling_salesman_problem
mw-redirect
Traveling salesman problem

values: Minimum spanning tree-based segmentation

values:
/wiki/Steiner_tree
mw-redirect
Steiner tree

values:
/wiki/Rectilinear_distance
mw-redirect
Rectilinear distance

values:
/wiki/Chu%E2%80%93Liu/Edmonds_algorithm
mw-redirect
Chu–Liu/Edmonds algorithm

values: Journal of the Association for Computing Machinery

values:
nofollow
external text
//doi.org/10.1145/505241.505243

values:
nofollow
external text
//doi.org/10.1145/201019.201022

values:
nofollow
external text
//doi.org/10.1145/355541.355562

values:
nofollow
external text
//doi.org/10.1145/355541.355554

values:
nofollow
external text
//doi.org/10.1145/28869.28874

values:
nofollow
external text
//doi.org/10.1007/bf02579168

values:
nofollow
external text
//doi.org/10.1145/375827.375847

values:
/wiki/David_A._Bader
mw-redirect
David A. Bader

values:
nofollow
external text
//doi.org/10.1016/j.jpdc.2006.06.001

values:
nofollow
external text
//doi.org/10.1109/MAHC.1985.10011

values:
nofollow
external text
//doi.org/10.1145/800141.804689

values:
/wiki/PubMed_Identifier
mw-redirect
PubMed Identifier

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/13475686

values:
nofollow
external text
//doi.org/10.1145/73393.73419

values:
nofollow
external text
//doi.org/10.2307/2346439

values:
nofollow
external text
//doi.org/10.1016/j.patrec.2004.09.039

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/12016051

values:
nofollow
external text
//doi.org/10.1145/359657.359665

values:
nofollow
external text
//doi.org/10.1109/ICIP.2000.901000

values:
nofollow
external text
//doi.org/10.1109/MELCON.2004.1346826

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/2737116

values:
nofollow
external text
//doi.org/10.1109/59.76691

values:
nofollow
external text
//doi.org/10.1137/0206011

values:
nofollow
external text
//doi.org/10.1007/BF01994879

values:
nofollow
external text
//doi.org/10.1287/opre.9.6.898

values:
nofollow
external text
//www.jstor.org/stable/167055

values:
nofollow
external text
//doi.org/10.1137/0204032

values:
nofollow
external text
//doi.org/10.1145/502090.502095

values: -moz-column-width: 30em; -webkit-column-width: 30em; column-width: 30em; list-style-type: decimal;

values:
/wiki/Ronald_L._Rivest
mw-redirect
Ronald L. Rivest

values:
nofollow
external text
http://www.codeplex.com/quickgraph

values:
catlinks mw-normal-catlinks
catlinks mw-normal-catlinks
interface

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values:
/wiki/Minimum_spanning_tree
View the content page [ctrl-alt-c]
c

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Featured content – the best of Wikipedia

values: Find background information on current events

values:
/wiki/Special:Random
Load a random article [ctrl-alt-x]
x

values: portal navigation p-navigation p-navigation-label

values: Guidance on how to use and edit Wikipedia

values: About the project, what you can do, where to find things

values: A list of recent changes in the wiki [ctrl-alt-r]

values: portal navigation p-interaction p-interaction-label

values: List of all English Wikipedia pages containing links to this page [ctrl-alt-j]

values: Recent changes in pages linked from this page [ctrl-alt-k]

values:
/wiki/Wikipedia:File_Upload_Wizard
Upload files [ctrl-alt-u]
u

values: A list of all special pages [ctrl-alt-q]

values: portal navigation p-wikibase-otherprojects p-wikibase-otherprojects-label

values: Ελάχιστο γεννητικό δέντρο – Greek

values:
interlanguage-link interwiki-el
display: none;

values:
interlanguage-link interwiki-eo
display: none;

values: درخت پوشای کمینه – Persian

values: Arbre couvrant de poids minimal – French

values: Նվազագույն ակնթարթային ծառ – Armenian

values:
interlanguage-link interwiki-hy
display: none;

values: עץ פורש מינימלי – Hebrew

values:
interlanguage-link interwiki-he
display: none;

values:
interlanguage-link interwiki-hu
display: none;

values:
interlanguage-link interwiki-nl
display: none;

values:
interlanguage-link interwiki-pl
display: none;

values: Минимальное остовное дерево – Russian

values:
interlanguage-link interwiki-simple
display: none;

values:
interlanguage-link interwiki-sk
display: none;

values:
interlanguage-link interwiki-sl
display: none;

values: Разапињуће стабло минималног степена – Serbian

values:
interlanguage-link interwiki-sr
display: none;

values:
interlanguage-link interwiki-sv
display: none;

values: ต้นไม้แบบทอดข้ามน้อยสุด – Thai

values:
interlanguage-link interwiki-th
display: none;

values: Мінімальне кістякове дерево – Ukrainian

values:
interlanguage-link interwiki-uk
display: none;

values: All languages (initial selection from common choices by you and others)

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Minimum_spanning_tree rootpage-Minimum_spanning_tree skin-vector action-view


text:
Remember Me (Blue Boy song)
From Wikipedia, the free encyclopedia
Jump to: navigation, search
"Remember Me"
Single by Blue Boy
Released
1997
Format
CD, 12", cassette
Label
Altra Moda Music (World)
Songwriter(s)
Lex Blackmore
Robert Miller
Richard Evans
Marlena Shaw
Producer(s)
Lex Blackmore
Blue Boy singles chronology
"It's Up to You"
(1996) "Remember Me"
(1997) "Sandman"
(1997)
"It's Up to You"
(1996) "Remember Me"
(1997) "Sandman"
(1997)
Remember Me is a 1997 song by Blue Boy. It peaked at No. 8 in the UK Singles Chart in February 1997[1] and number two on the American dance chart.[2]
Contents
[hide]
1 Background
2 Track listing
2.1 Cover versions
3 Charts
3.1 Weekly charts
3.2 Year-end charts
4 References
Background[edit]
The track originally appeared on Mark Farina's remix album Mushroom Jazz Volume One. Jive Records got hold of it and earmarked it for single release. The radio edit was remixed by Sure Is Pure, who were also responsible for a remix of Lost in Music, and was released on the Pharm sublabel imprint.
The track is built around samples from "Woman of the Ghetto" by Marlena Shaw: "Remember me? I'm the one who had your babies, I", in reference to African-American maids raising white children for little pay, came from a live version, whereas the "ging, gi-gi-gi-gi-ging..." sample repeated throughout the song is the scat portion of the original song's refrain.[3] Shaw had the following to say about it:
When it first happened, and the Mushroom Jazz people contacted me from San Francisco, I was kind of excited about it. But then, once I actually HEARD it, my first reaction was 'Oh my goodness! How in the world can I possibly stand onstage and sing those same notes, and those same lyrics, over and over again?'! You know, 'I'm the one who had your babies - ha-ha-ha-ha'! I mean, it’s different when it's being recorded and you're just pushing the button! But then, once I got used to the idea, I became excited all over again! And actually several other people have sampled the song since, though with them it's been the onstage version I did on the (1973-released) 'Live At Montreux' album that seems to have got more attention - I guess because it was more spontaneous. Which, as I say, is something that HAPPENS in my live performances! And I particularly liked the St. Germain version, which had more of a jazz flavour to it.[4]
Track listing[edit]
UK CD
Catalogue number CDPHARM1
"Remember Me" (Sure Is Pure 7" edit) – 3:50
"Remember Me" (original 12") – 7:04
"Remember Me" (Sure Is Pure 12" remix) – 10:46
"Remember Me" (Cavern 3 remix) – 10:11
"Remember Me" (Rae and Christian remix) – 6:57
Europe CD
European release on Jive Records (catalogue number 051628-2).
"Remember Me" (Sure Is Pure 7" edit) – 3:49
"Remember Me" (original 7" edit) – 3:54
"Remember Me" (Deep Zone club mix) – 7:30
"Remember Me" (Dub Zone) – 8:30
"Remember Me" (Sure Is Pure 12" remix) – 10:46
"Remember Me" (original 12" mix) – 7:04
"Remember Me" (Sub Dub) – 8:13
Cover versions[edit]
In early 2009, the Australian psychedelic rock band Tame Impala started performing this song as part of their live sets, eventually recording a cover version of it as a B-side to the "Sundown Syndrome" single. This cover has become quite popular in Australia, reaching number 78 in the Triple J Hottest 100, 2009.[5]
In late 2010, Gianni Luminati of Walk off the Earth released a song on YouTube, "Jammin' a Hammock", playing 3 instruments simultaneously, while lying in a hammock; it is an interpretation of this song.[6]
In November 2012, British musician Daley sampled this song for his own composition "Remember Me", with the refrain sung by Jessie J.[7]
In 2013, the South African group Goldfish sampled the song for their track Three Second Memory. TheSouthAfrican.com called the song "Where to start? Obviously the title track, which takes the vocal sample "Remember Me" and builds around it to a level which justifies its standing as the basis of the album."[8]
Charts[edit]
Weekly charts[edit]
Chart (1997)
Peak
position
Australia (ARIA)[9] 17
Austria (Ö3 Austria Top 40)[10] 21
Belgium (Ultratop 50 Flanders)[11] 12
Belgium (Ultratop 50 Wallonia)[12] 17
Canada Dance/Urban (RPM)[13] 6
Denmark (IFPI)[14] 4
Finland (Suomen virallinen lista)[15] 5
France (SNEP)[16] 17
Germany (Official German Charts)[17] 18
Ireland (IRMA)[18] 6
Italy (Musica e dischi / FIMI)[19] 18
Netherlands (Dutch Top 40)[20] 13
Netherlands (Single Top 100)[21] 17
Norway (VG-lista)[22] 4
Spain (AFYVE)[23] 4
Sweden (Sverigetopplistan)[24] 8
Switzerland (Schweizer Hitparade)[25] 4
UK Singles (Official Charts Company)[1] 8
US Billboard Hot Dance Club Play[2] 2
US Billboard Hot Dance Music/Maxi-Singles Sales[2] 27
Year-end charts[edit]
Chart (1997)
Rank
Australia (ARIA)[26] 71
Belgium (Ultratop 50 Flanders)[27] 66
Belgium (Ultratop 50 Wallonia)[28] 81
Germany (Official German Charts)[29] 77
Netherlands (Dutch Top 40)[30] 93
Sweden (Sverigetopplistan)[31] 66
Switzerland (Schweizer Hitparade)[32] 26
US Billboard Hot Dance Club Play[33] 36
References[edit]
^ Jump up to: a b "Official Singles Chart Top 100". Official Charts Company. Retrieved 12 May 2016.
^ Jump up to: a b c "Hits of the World". Billboard. Vol. 109 no. 42. 18 October 1997. p. 34. ISSN 0006-2510.
Jump up ^ "Why do people love to sample Marlene Shaw?". Electric Soul Show. 4 January 2014. Retrieved 12 May 2016.
Jump up ^ Lewis, Pete. "MARLENA SHAW: California Soul II Soul". Blues & Soul. Retrieved 12 May 2016.
Jump up ^ "Hottest 100 2009". Triple J. ABC Online. 2009. Retrieved 19 December 2013.
Jump up ^ "Jammin' a Hammock - Walk off the Earth" on YouTube
Jump up ^ Ferrol, Natalie. "Jessie J and Daley cover Blue Boy's Remember Me (I'm The One Who Had Your Babies)". MOBO Awards. Retrieved 12 May 2016.
Jump up ^ Hillyer, Tim (15 April 2014). "Album Review: 'Three Second Memory' – Goldfish". Archived from the original on 14 July 2014. . TheSouthAfrican.com.
Jump up ^ "Australian-charts.com – The Blue Boy – Remember Me". ARIA Top 50 Singles. Retrieved 12 May 2016.
Jump up ^ "Austriancharts.at – The Blue Boy – Remember Me" (in German). Ö3 Austria Top 40. Retrieved 12 May 2016.
Jump up ^ "Ultratop.be – The Blue Boy – Remember Me" (in Dutch). Ultratop 50. Retrieved 12 May 2016.
Jump up ^ "Ultratop.be – The Blue Boy – Remember Me" (in French). Ultratop 50. Retrieved 12 May 2016.
Jump up ^ "Top RPM Dance/Urban: Issue 3285." RPM. Library and Archives Canada. Retrieved 12 May 2016.
Jump up ^ "Hits of the World". Billboard. Vol. 109 no. 25. 21 June 1997. p. 51. ISSN 0006-2510. see last week position.
Jump up ^ "Blue Boy: Remember Me" (in Finnish). Musiikkituottajat – IFPI Finland. Retrieved 12 May 2016.
Jump up ^ "Lescharts.com – The Blue Boy – Remember Me" (in French). Les classement single. Retrieved 12 May 2016.
Jump up ^ "Offiziellecharts.de – The Blue Boy – Remember Me". GfK Entertainment Charts. Retrieved 12 May 2016.
Jump up ^ "The Irish Charts – Search Results – Blue Boy". Irish Singles Chart. Retrieved 12 May 2016.
Jump up ^ "Hits of the World". Billboard. Vol. 109 no. 22. 31 May 1997. p. 60. ISSN 0006-2510.
Jump up ^ "Nederlandse Top 40 – Blue Boy - Remember Me search results" (in Dutch) Dutch Top 40. Retrieved 12 May 2016.
Jump up ^ "Dutchcharts.nl – The Blue Boy – Remember Me" (in Dutch). Single Top 100. Retrieved 12 May 2016.
Jump up ^ "Norwegiancharts.com – The Blue Boy – Remember Me". VG-lista. Retrieved 12 May 2016.
Jump up ^ "Hits of the World". Billboard. Vol. 109 no. 29. 19 July 1997. p. 59. ISSN 0006-2510. see last week position.
Jump up ^ "Swedishcharts.com – The Blue Boy – Remember Me". Singles Top 100. Retrieved 12 May 2016.
Jump up ^ "Swisscharts.com – The Blue Boy – Remember Me". Swiss Singles Chart. Retrieved 12 May 2016.
Jump up ^ "ARIA Charts – End Of Year Charts – Top 100 Singles 1997". ARIA Charts. Australian Recording Industry Association. Retrieved 12 May 2016.
Jump up ^ "Jaaroverzichten 1997" (in Dutch). Ultratop. Hung Medien. Retrieved 12 May 2016.
Jump up ^ "Rapports annuels 1997" (in French). Ultratop. Hung Medien. Retrieved 12 May 2016.
Jump up ^ (in German) "Jahrescharts – 1997". Archived from the original on 9 May 2015. . Offiziellecharts.de. GfK Entertainment Charts.
Jump up ^ "Top 100-Jaaroverzicht van 1997" (in Dutch). Dutch Top 40. Retrieved 12 May 2016.
Jump up ^ "Årslista Singlar – År 1997". Archived from the original on 25 September 2015. . Hitlistan.se.
Jump up ^ "Schweizer Jahreshitparade 1997" (in German). Hitparade.ch. Hung Medien. Retrieved 12 May 2016.
Jump up ^ "Hot Dance Club-Play Singles". Billboard. Vol. 109 no. 52. 27 December 1997. p. YE-44. ISSN 0006-2510.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Remember_Me_(Blue_Boy_song)&oldid=786315585"
Categories:
1997 songs
1997 singles
Hidden categories:
CS1 Dutch-language sources (nl)
CS1 French-language sources (fr)
Articles with German-language external links
CS1 German-language sources (de)
Singlechart usages for Australia
Singlechart usages for Austria
Singlechart usages for Flanders
Singlechart usages for Wallonia
Singlechart usages for Canadadance
Singlechart called without artist
Singlechart called without song
Singlechart usages for Finland
Singlechart usages for France
Singlechart usages for Germany2
Singlechart usages for Ireland2
Singlechart usages for Dutch40
Singlechart usages for Dutch100
Singlechart usages for Norway
Singlechart usages for Sweden
Singlechart usages for Switzerland
Singlechart usages for UK
Singlechart making named ref
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
Add links
This page was last edited on 18 June 2017, at 17:27.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

values: mw-page-base noprint

values: mw-head-base noprint

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

value: th

attrs: colspan class style

value: tr

attrs: alt src width height srcset data-file-width data-file-height

value: td

attrs: colspan style

values: width: 33%; text-align: center; vertical-align: top; padding: .2em .1em .2em 0;

values: width: 33%; text-align: center; vertical-align: top; padding:.2em .1em;

values: width: 33%; text-align: center; vertical-align: top; padding: .2em 0 .2em .1em;

values: background: transparent; width: 100%; min-width: 100%; border-collapse: collapse;

values: width:33%; padding:.2em .1em .2em 0; text-align: center;

values: width:33%; padding:.2em .1em; text-align: center;

values: width:33%; padding:.2em 0 .2em .1em; text-align: center;

values:
headerSort
0
columnheader button
Sort ascending

values: Syndicat National de l'Édition Phonographique

values: border-collapse: collapse; padding: 0; border: 0; background:transparent; width:100%;

values:
nofollow
external text
//www.worldcat.org/issn/0006-2510

values: -moz-column-width: 30em; -webkit-column-width: 30em; column-width: 30em; list-style-type: decimal;

values: Category:CS1 Dutch-language sources (nl)

values: Category:CS1 French-language sources (fr)

values: Category:Articles with German-language external links

values: Category:CS1 German-language sources (de)

values: Category:Singlechart usages for Australia

values: Category:Singlechart usages for Flanders

values: Category:Singlechart usages for Wallonia

values: Category:Singlechart usages for Canadadance

values: Category:Singlechart called without artist

values: Category:Singlechart called without song

values: Category:Singlechart usages for Germany2

values: Category:Singlechart usages for Ireland2

values: Category:Singlechart usages for Dutch100

values: Category:Singlechart usages for Switzerland

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/Remember_Me_(Blue_Boy_song)
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Featured content – the best of Wikipedia

values: Find background information on current events

values:
/wiki/Special:Random
Load a random article [ctrl-alt-x]
x

values: portal navigation p-navigation p-navigation-label

values: Guidance on how to use and edit Wikipedia

values: About the project, what you can do, where to find things

values: A list of recent changes in the wiki [ctrl-alt-r]

values: portal navigation p-interaction p-interaction-label

values: List of all English Wikipedia pages containing links to this page [ctrl-alt-j]

values: Recent changes in pages linked from this page [ctrl-alt-k]

values:
/wiki/Wikipedia:File_Upload_Wizard
Upload files [ctrl-alt-u]
u

values: A list of all special pages [ctrl-alt-q]

values: Permanent link to this revision of the page

values: Link to connected data repository item [ctrl-alt-g]

values: Printable version of this page [ctrl-alt-p]

values:
uls-settings-trigger
Language settings
0
button
true

values: /static/images/wikimedia-button-1.5x.png 1.5x, /static/images/wikimedia-button-2x.png 2x

values: /static/images/poweredby_mediawiki_132x47.png 1.5x, /static/images/poweredby_mediawiki_176x62.png 2x

values:
suggestions
display: none; font-size: 13px;

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Remember_Me_Blue_Boy_song rootpage-Remember_Me_Blue_Boy_song skin-vector action-view