Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6695673
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T06:15:00+00:00 2026-05-26T06:15:00+00:00

I am using Queue.Priority class in python 2.7 as below q=Queue.PriorityQueue() q.put((2,second)) q.put((1,first)) q.put((3,third))

  • 0

I am using Queue.Priority class in python 2.7 as below

q=Queue.PriorityQueue()
q.put((2,"second"))
q.put((1,"first"))
q.put((3,"third"))
print q.get(True)
print q.get(True)
print q.get(True)

This would return the following result since get() returns the item of lowest priority

(1, 'first')
(2, 'second')
(3, 'third') 

Suppose,I need get to return the item of highest priority .what should I do? Is there a way to do this other than overriding get() method?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-26T06:15:01+00:00Added an answer on May 26, 2026 at 6:15 am

    If it’s just the first element of the tuple that matters, and it’s an integer, you could simply negate it:

    q=Queue.PriorityQueue()
    q.put((-2,"second"))
    q.put((-1,"first"))
    q.put((-3,"third"))
    print q.get(True)
    print q.get(True)
    print q.get(True)
    

    This will print out:

    (-3, 'third') 
    (-2, 'second')
    (-1, 'first')
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

At the moment, I am trying to write a priority queue in Python using
I'm writing a data structure in C# (a priority queue using a fibonacci heap
In this question , I asked about using queue's and threads in C#. I
I'm browsing source codes from two applications sharing one queue using MSMQ. The first
I'm using delayed_job for a priority queue. I was wondering how do i define
I'm trying to use a PriorityQueue to order objects using a Comparator . This
Possible Duplicate: Priority queue in .Net This question is similar, but i want to
I have to implement Priority Queue using MultiMap. I use MultiMap from Google Collections.
In the big picture, I'm trying to implement Dijkstra's algorithm using a priority queue.
In Python, the heapq module provides a priority queue. It has methods for inserting

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.