Releases: josek98/pywgraph
[1.1.0]Pywgraph
Paths and cycles!
In this new release some major changes where made. Now the method find_path
is replaced with find_paths
. This method is able to finde all paths connecting the selected nodes. You add parameters to allow multiple visists to some or all nodes during the search of a path.
Also add a method to find cycles that contains an specific node and the property to return all cycles of the graph. Now you can also check if a graph is conmutative with the is_conmutative
property. Check release notes and README.MD
to find more information about changes.
What's Changed
Full Changelog: v1.0.2...v1.1.0
[1.0.2]pywgraph
As in previous minor release methods to add nodes and edges were added in this minor release I add methos to delete nodes and edges.
What's Changed
Full Changelog: v1.0.1...v1.0.2
[1.0.1]pywgraph
In this release two new methods were added. This are:
WeightedDirectedGraph.add_node
: It is use to add a node to an existing graph.WeightedDirectedGraph.add_edge
: It is use to connect two existing nodes creating an edge between them. The weight of the edge can be either given or self calculated with a path between the nodes.
What's Changed
Full Changelog: v1.0.0.post1...v1.0.1
Launch on PyPi
GRAPHS ARE HERE!!!
This is the release of pywgraph
, a python library design to implement weighted directed graphs where weights of edges can be elements of an specific mathematical group. With this abstraction, you can traverse the graph over the edges and using the group operation to get the weight of the travelled path. If you want to use it simpler, when no group is specify the weights are suppose to be floating numbers with the multiplication to calculate weight over paths.
[0.4.0]pywgraph-Groups have arrived!
GROUPS HAVE ARRIVED!!
In the current version, an abstraction of a mathematical group has been develop. Now you can use as weights any element of a defined group. The behaviour of the objects in the previous version is still working since not specifying a group sets the multiplication group of the real numbers, which is what it used to be. The only exception is that when trying to get the weight of an empty path the return is no more 0. Now is None, but you can set anything you want just by passing the default
parameter, similar to the get
method from Python's dictionaries.
What's Changed
Full Changelog: v0.3.0...v0.4.0
[0.3.0]-path_finding-pywgraph
Path finding method add!
Now it is possible to search for the shortest path between two given nodes with the WeightedDirectedGraph.find_path
method. You can also give a path with an get the weight of following the path with the WeightedDirectedGraph.path_weight
method. Combining this two method also the WeightedDirectedGraph.weight_between
gives you the weight of the shortest path between two given nodes.
What's Changed
Full Changelog: v0.2.0...v0.3.0
[0.2.1]pywgraph
This minor updat just improves the README.md file
Full Changelog: v0.2.0...v0.2.1
[0.2.0]pywgraph
The weights have been simplify so now they only consists of a float. In future versions the aim is to be able so that the weight can be any object with a binary operation with inverse.
For the graph class, now graphs are comparable and can be instantiate with the new from_dict
method.
What's Changed
Full Changelog: v0.1.0...v0.2.0
Full Changelog: v0.2.0...v0.2.0
[0.1.0]pywgraph
Release of the pywgraph library to manage weighted directed graphs in python. Currently still working on adding features like searching for paths in the graph.
What's Changed
- Develop by @josek98 in #1
- Enforce DirectedEdge so that start and end must be different. Add Nod… by @josek98 in #2
New Contributors
Full Changelog: https://github.com/josek98/pywgraph/commits/v0.1.0