git: 4cd6d2d387cd - main - math/py-munkres: Update WWW and clean up pkg-descr

The branch main has been updated by sunpoet:

URL: https://cgit.FreeBSD.org/ports/commit/?id=4cd6d2d387cd7e8c89f24d6fbf972a83d0868fac

commit 4cd6d2d387cd7e8c89f24d6fbf972a83d0868fac
Author:     Po-Chuan Hsieh <sunpoet@FreeBSD.org>
AuthorDate: 2023-04-05 17:17:55 +0000
Commit:     Po-Chuan Hsieh <sunpoet@FreeBSD.org>
CommitDate: 2023-04-05 17:30:45 +0000

    math/py-munkres: Update WWW and clean up pkg-descr
---
 math/py-munkres/Makefile  | 3 ++-
 math/py-munkres/pkg-descr | 2 --
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/math/py-munkres/Makefile b/math/py-munkres/Makefile
index 351f5ddda732..d9ee87afdc59 100644
--- a/math/py-munkres/Makefile
+++ b/math/py-munkres/Makefile
@@ -6,7 +6,8 @@ PKGNAMEPREFIX=	${PYTHON_PKGNAMEPREFIX}
 
 MAINTAINER=	sunpoet@FreeBSD.org
 COMMENT=	Munkres implementation for Python
-WWW=		https://software.clapper.org/munkres/
+WWW=		https://software.clapper.org/munkres/ \
+		https://github.com/bmc/munkres
 
 LICENSE=	APACHE20
 
diff --git a/math/py-munkres/pkg-descr b/math/py-munkres/pkg-descr
index 4e985e27459f..67c6bfb19c3c 100644
--- a/math/py-munkres/pkg-descr
+++ b/math/py-munkres/pkg-descr
@@ -4,5 +4,3 @@ 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.
-
-See also: https://github.com/bmc/munkres