aboutsummaryrefslogtreecommitdiff
path: root/math/igraph/distinfo
Commit message (Collapse)AuthorAgeFilesLines
* math/igraph: Update to 0.10.12Wen Heping2024-06-151-3/+3
|
* math/igraph: Update to 0.10.6Daniel Engberg2023-08-301-3/+3
| | | | | | | | | | | | | | * Switch to DISTVERSION * Always use Flex from ports There are some issues with ARPACK 3.9.0 and igraph, tracked in PR 273227. Changelog: https://github.com/igraph/igraph/releases/tag/0.10.6 PR: 273117 Reviewed by: wen (maintainer) Sponsored by: Blinkinblox
* math/igraph: Update to 0.10.4Wen Heping2023-02-261-3/+3
|
* math/igraph: Update to 0.9.8Wen Heping2022-04-281-3/+3
|
* math/igraph: Use upstream release archiveDaniel Engberg2022-03-191-3/+3
| | | | | | | | | - Define LICENSE_FILE - Remove libtool dependency - Use DISTVERSION to follow Porters Handbook more closely PR: 262019 Reviewed by: wen (maintainer)
* math/igraph: Update to 0.9.6Wen Heping2022-02-171-3/+3
|
* math/igraph: Update to 0.9.5Wen Heping2021-12-241-3/+3
| | | | | PR: 254873 Reported by: yuri@
* - Update to 0.8.5Wen Heping2020-12-111-3/+3
| | | | Notes: svn path=/head/; revision=557700
* math/igraph: Update 0.7.1 -> 0.8.2Yuri Victorovich2020-08-181-2/+3
| | | | | | | | PR: 248660 Approved by: wen (maintainer) Notes: svn path=/head/; revision=545242
* - Update to 0.7.1Wen Heping2015-01-101-2/+2
| | | | | | | | - Add LICENSE - Update WWW Notes: svn path=/head/; revision=376704
* - Update to 0.5.4Wen Heping2010-11-081-3/+2
| | | | | | | - Update my email to FreeBSD Notes: svn path=/head/; revision=264226
* - Update to 0.5.3Wen Heping2010-05-021-3/+3
| | | | Notes: svn path=/head/; revision=253527
* - Update to 0.5.2Martin Wilke2009-04-261-3/+3
| | | | | | | | PR: 134019 Submitted by: Wen Heping <wenheping@gmail.com> (maintainer) Notes: svn path=/head/; revision=232794
* - Update to 0.5.1Martin Wilke2008-08-181-3/+3
| | | | | | | | PR: 126581 Submitted by: Wen heping <wenheping@gmail.com> (maintainer) Notes: svn path=/head/; revision=218792
* igraph is a free software package for creating and manipulatingMartin Wilke2008-07-181-0/+3
undirected and directed graphs. It includes implementations for classic graph theory problems like minimum spanning trees and network flow, and also implements algorithms for some recent network analysis methods, like community structure search. igraph contains functions for generating regular and random graphs, manipulating graphs, assigning attributes to vertices and edges. It can calculate various structural properties, includes heuristics for community structure detection, supports many file formats. WWW: http://cneurocvs.rmki.kfki.hu/igraph/ PR: ports/125534 Submitted by: Wen Heping <wenheping at gmail.com> Notes: svn path=/head/; revision=217031