Releases: Mathics3/pymathics-graph
9.0.0
8.0.1
Merge pull request #40 from Mathics3/release-8.0.0
This release tracks the API changes in the Mathics Kernel.
- Added builtin function
GraphQ[]. (Combinatorica uses this) - Redo
DirectedEdgeandUndirectedEdgeas operators
August Surprise
- Revise for 7.0.0 Mathics3 API; we need to explicilty load builtins
- Newer matplotlib requires a plot close.
- Networkx 3.3 supported
- sort connected components in output
Too late for Valentines Day
Revise for 6.0.0 Mathics3 API and current Mathics3 builtin standards described in Guidelines for Writing Documentation.
Thie package has undergone a major overhaul. Modules have been split out along into logical groups following the documentation structure.
We have gradually been rolling in more Python type annotations and have been using current Python practices. Tools such as using isort, black and flake8 are used as well.
Evaluation methods of built-in functions start eval_ not apply_.
There is more refactoring more to do here, Upgrade to NetworkX is also desirable.
5.0.0a0
Get ready for release 2.3.0
Small API changes to track Mathics 3.0.0.
Blacken everything
L-3
Christmas 2020 - what a year!
First public release.
The names below follow the WL names. Look up the corresponding documentation for information about these.
Functions provided
AcyclicGraphQAdjacencyListBalancedTreeBarbellGraphBetweennessCentralityBinomialTreeClosenessCentralityCompleteGraphCompleteKaryTreeConnectedComponentsConnectedGraphQCycleGraphDegreeCentralityDirectedEdgeDirectedGraphQEdgeAddEdgeConnectivityEdgeCountEdgeDeleteEdgeIndexEdgeListEdgeRulesEigenvectorCentralityFindShortestPathFindSpanningTreeFindVertexCutFullRAryTreeGraphGraphAtlasGraphBoxGraphDataGraphDistanceHITSCentralityHighlightGraphHknHararyGraphHmnHararyGraphKaryTreeKatzCentralityLadderGraphLoopFreeGraphQMixedGraphQMultigraphQPageRankCentralityPathGraphPathGraphQPlanarGraphQPropertyPropertyValueRandomGraphRandomTreeSimpleGraphQStarGraphTreeGraphTreeGraphQUndirectedEdgeVertexAddVertexConnectivityVertexCountVertexDegreeVertexDeleteVertexIndexVertexListWeaklyConnectedComponents
GraphData names
DodecahedralGraphDiamondGraphPappusGraphIsohedralGraphPetersenGraph
The names below follow the WL names. Look up the corresponding documentation for information about these.
However you can also use the corresponding networkx name, e.g. "c" for "Circle", "D" for "Diamond", etc.
Node Marker Names
CircleDiamondSquareStarPentagonOctagonHexagonTriangle