Update to 1.0.11

- Update LICENSE
- Add NO_ARCH
- Update pkg-descr
- Update WWW
- Take maintainership

Changes:	https://github.com/bmc/munkres/blob/master/CHANGELOG.md

math/py-munkres/Makefile

@@ -2,18 +2,19 @@
 # $FreeBSD$
 
 PORTNAME=	munkres
-PORTVERSION=	1.0.7
+PORTVERSION=	1.0.11
 CATEGORIES=	math python
 MASTER_SITES=	CHEESESHOP
 PKGNAMEPREFIX=	${PYTHON_PKGNAMEPREFIX}
 
-MAINTAINER=	ports@FreeBSD.org
-COMMENT=	Python implementation of the munkres algorithm
+MAINTAINER=	sunpoet@FreeBSD.org
+COMMENT=	Munkres implementation for Python
 
-LICENSE=	BSD3CLAUSE
-LICENSE_FILE=	${WRKSRC}/LICENSE
+LICENSE=	APACHE20
 
 USES=		python
-USE_PYTHON=	distutils autoplist
+USE_PYTHON=	autoplist concurrent distutils
+
+NO_ARCH=	yes
 
 .include <bsd.port.mk>

math/py-munkres/distinfo

@@ -1,2 +1,3 @@
-SHA256 (munkres-1.0.7.tar.gz) = 334a5d849bcefed3e4c32ecfbca4ee8dfc8ef5f2f181334d6f7f4e100b71d6c4
-SIZE (munkres-1.0.7.tar.gz) = 9652
+TIMESTAMP = 1540926202
+SHA256 (munkres-1.0.11.tar.gz) = 7188f2ed6e8d3eb6c5ec4919200faa6194732b99707b058f7e9f068c588f7eca
+SIZE (munkres-1.0.11.tar.gz) = 11322

math/py-munkres/pkg-descr

@@ -1,3 +1,8 @@
-A python implementation of the munkres algorithm
+The Munkres module provides an implementation of the Munkres algorithm (also
+called the Hungarian algorithm or the Kuhn-Munkres algorithm). The algorithm
+models an assignment problem as an NxM cost matrix, where each element
+represents the cost of assigning the ith worker to the jth job, and it figures
+out the least-cost solution, choosing a single item from each row and column in
+the matrix, such that no row and no column are used more than once.
 
-WWW: http://software.clapper.org/munkres/
+WWW: https://software.clapper.org/munkres/