Skip to content

Commit d1661c0

Browse files
committed
Prepare v0.9.3 release
1 parent 8ac0c49 commit d1661c0

File tree

2 files changed

+24
-12
lines changed

2 files changed

+24
-12
lines changed

CHANGELOG.md

+11
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,16 @@
11
# Changelog
22

3+
## 0.9.3 (2021-12-30)
4+
5+
* Feature: Support PHP 8.1 release.
6+
(#208 by @clue)
7+
8+
* Fix: Fix automatic vertex ID generation when using vertex IDs with strings.
9+
(#204 by @viktorprogger)
10+
11+
* Improve test suite and use GitHub Actions for continuous integration (CI).
12+
(#207 by @clue)
13+
314
## 0.9.2 (2020-12-03)
415

516
* Feature: Support PHP 8 and PHPUnit 9.3.

README.md

+13-12
Original file line numberDiff line numberDiff line change
@@ -26,11 +26,9 @@ Once [installed](#install), let's initialize a sample graph:
2626
```php
2727
<?php
2828

29-
use \Fhaculty\Graph\Graph as Graph;
29+
require __DIR__ . '/vendor/autoload.php';
3030

31-
require_once 'vendor/autoload.php';
32-
33-
$graph = new Graph();
31+
$graph = new Fhaculty\Graph\Graph();
3432

3533
// create some cities
3634
$rome = $graph->createVertex('Rome');
@@ -55,9 +53,9 @@ foreach ($rome->getVerticesEdgeFrom() as $vertex) {
5553

5654
## Features
5755

58-
This library is built around the concept of [mathematical graph theory](https://en.wikipedia.org/wiki/Graph_theory) (i.e. it is **not** a [charting](http://en.wikipedia.org/wiki/Chart) library for drawing a [graph of a function](http://en.wikipedia.org/wiki/Graph_of_a_function)). In essence, a graph is a set of *nodes* with any number of *connections* in between. In graph theory, [vertices](http://en.wikipedia.org/wiki/Vertex_%28graph_theory%29) (plural of vertex) are an abstract representation of these *nodes*, while *connections* are represented as *edges*. Edges may be either undirected ("two-way") or directed ("one-way", aka di-edges, arcs).
56+
This library is built around the concept of [mathematical graph theory](https://en.wikipedia.org/wiki/Graph_theory) (i.e. it is **not** a [charting](https://en.wikipedia.org/wiki/Chart) library for drawing a [graph of a function](https://en.wikipedia.org/wiki/Graph_of_a_function)). In essence, a graph is a set of *nodes* with any number of *connections* in between. In graph theory, [vertices](https://en.wikipedia.org/wiki/Vertex_%28graph_theory%29) (plural of vertex) are an abstract representation of these *nodes*, while *connections* are represented as *edges*. Edges may be either undirected ("two-way") or directed ("one-way", aka di-edges, arcs).
5957

60-
Depending on how the edges are constructed, the whole graph can either be undirected, can be a [directed graph](http://en.wikipedia.org/wiki/Directed_graph) (aka digraph) or be a [mixed graph](https://en.wikipedia.org/wiki/Mixed_graph). Edges are also allowed to form [loops](http://en.wikipedia.org/wiki/Loop_%28graph_theory%29) (i.e. an edge from vertex A pointing to vertex A again). Also, [multiple edges](http://en.wikipedia.org/wiki/Multiple_edges) from vertex A to vertex B are supported as well (aka parallel edges), effectively forming a [multigraph](http://en.wikipedia.org/wiki/Multigraph) (aka pseudograph). And of course, any combination thereof is supported as well. While many authors try to differentiate between these core concepts, this library tries hard to not impose any artificial limitations or assumptions on your graphs.
58+
Depending on how the edges are constructed, the whole graph can either be undirected, can be a [directed graph](https://en.wikipedia.org/wiki/Directed_graph) (aka digraph) or be a [mixed graph](https://en.wikipedia.org/wiki/Mixed_graph). Edges are also allowed to form [loops](https://en.wikipedia.org/wiki/Loop_%28graph_theory%29) (i.e. an edge from vertex A pointing to vertex A again). Also, [multiple edges](https://en.wikipedia.org/wiki/Multiple_edges) from vertex A to vertex B are supported as well (aka parallel edges), effectively forming a [multigraph](https://en.wikipedia.org/wiki/Multigraph) (aka pseudograph). And of course, any combination thereof is supported as well. While many authors try to differentiate between these core concepts, this library tries hard to not impose any artificial limitations or assumptions on your graphs.
6159

6260
## Components
6361

@@ -70,7 +68,7 @@ Following is a list of some highlighted components. A list of all official compo
7068

7169
### Graph drawing
7270

73-
This library is built to support visualizing graph images, including them into webpages, opening up images from within CLI applications and exporting them as PNG, JPEG or SVG file formats (among many others). Because [graph drawing](http://en.wikipedia.org/wiki/Graph_drawing) is a complex area on its own, the actual layouting of the graph is left up to the excellent [GraphViz](http://www.graphviz.org/) "Graph Visualization Software" and we merely provide some convenient APIs to interface with GraphViz.
71+
This library is built to support visualizing graph images, including them into webpages, opening up images from within CLI applications and exporting them as PNG, JPEG or SVG file formats (among many others). Because [graph drawing](https://en.wikipedia.org/wiki/Graph_drawing) is a complex area on its own, the actual layouting of the graph is left up to the excellent [GraphViz](https://www.graphviz.org/) "Graph Visualization Software" and we merely provide some convenient APIs to interface with GraphViz.
7472

7573
See [graphp/graphviz](https://github.com/graphp/graphviz) for more details.
7674

@@ -105,13 +103,13 @@ See [graphp/algorithms](https://github.com/graphp/algorithms) for more details.
105103

106104
## Install
107105

108-
The recommended way to install this library is [through Composer](https://getcomposer.org).
106+
The recommended way to install this library is [through Composer](https://getcomposer.org/).
109107
[New to Composer?](https://getcomposer.org/doc/00-intro.md)
110108

111109
This will install the latest supported version:
112110

113111
```bash
114-
$ composer require clue/graph:^0.9.2
112+
$ composer require clue/graph:^0.9.3
115113
```
116114

117115
See also the [CHANGELOG](CHANGELOG.md) for details about version upgrades.
@@ -128,7 +126,7 @@ A list of all official components can be found in the [graphp project](https://g
128126

129127
This library uses PHPUnit for its extensive test suite.
130128
To run the test suite, you first need to clone this repo and then install all
131-
dependencies [through Composer](https://getcomposer.org):
129+
dependencies [through Composer](https://getcomposer.org/):
132130

133131
```bash
134132
$ composer install
@@ -137,7 +135,7 @@ $ composer install
137135
To run the test suite, go to the project root and run:
138136

139137
```bash
140-
$ php vendor/bin/phpunit
138+
$ vendor/bin/phpunit
141139
```
142140

143141
## Contributing
@@ -156,4 +154,7 @@ Check out #graphp on irc.freenode.net.
156154

157155
## License
158156

159-
Released under the terms of the permissive [MIT license](http://opensource.org/licenses/MIT).
157+
This project is released under the permissive [MIT license](LICENSE).
158+
159+
> Did you know that I offer custom development services and issuing invoices for
160+
sponsorships of releases and for contributions? Contact me (@clue) for details.

0 commit comments

Comments
 (0)