HP Forums / HP Calculators (and very old HP Computers) / HP Prime v / minimum spanning tree lua HPPL

Post Reply 
minimum spanning tree lua HPPL
11-02-2021, 05:53 AM
Post: #12
robmio Offline
Member
 		Posts: 170
Joined: Jan 2020
RE: minimum spanning tree lua HPPL
I address the question to Albert Chan: using the last algorithm you wrote, for a matrix of dimensions {100,4} the "physical" calculator PRIME_G2 takes about 13 seconds to calculate the "MST". Does your algorithm already include the implementation with the Fibonacci heap?
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
minimum spanning tree lua HPPL - robmio - 10-28-2021, 01:04 PM
RE: minimum spanning tree lua HPPL - robmio - 11-02-2021 05:53 AM



User(s) browsing this thread: 1 Guest(s)

Contact Us | The Museum of HP Calculators | Return to Top | Return to Content | Lite (Archive) Mode | RSS Syndication