Find min in list - python

Question

I'm doing a kind of Dijkstra as homework.
This is how the class Vertex looks.

class Vertex:
    def __init__(self, id, name):
        self.id = id
        self.name = name
        self.minDistance = float('inf')
        self.previousVertex = None

In other class I have a list of unvisited vertexes and I want to find a minimum distance, so I can recursively work with the Vertex having that minDistance.

e.g. unvisited = [Vertex1, Vertex2,...]

Tried to do it with for cycle, but by iterating it and saving it to a variable didn't work as it saved only the last value. How can I find a min value of a class atribute in list?

Jan Šimbera · Accepted Answer · 2018-01-25 13:18:21Z

6

A more Pythonic one-liner:

minDistance = min(otherVertex.distance for otherVertex in unvisited)

answered Jan 25, 2018 at 13:18

Jan Šimbera

4983 silver badges17 bronze badges

Sign up to request clarification or add additional context in comments.

6 Comments

ShadowRanger Over a year ago

As a complement to this, you can find the Vertex which has the minimum distance with minVertex = min(unvisited, key=operator.attrgetter('distance'))

Alessandro Petric Over a year ago

Díky, co když mi to ale najde nekonečno jako minimum?

ShadowRanger Over a year ago

@AlessandroPetric: Please try to stick to English on StackOverflow.

Alessandro Petric Over a year ago

Sorry, @ShadowRanger saw that the guy who answered is from Czech Republic, so I wrote it in czech. Anyway, it's working.

Jan Šimbera Over a year ago

You have to take care about inf yourself - that depends on your application. In Dijkstra it could mean there are no adjacent vertices = abort search.

|

Collectives™ on Stack Overflow

Find min in list - python

1 Answer 1

6 Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

6 Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related