-----
First public release.
The names below follow the WL names. Look up the corresponding documentation for information about these.
Functions provided
------------------
- ``AcyclicGraphQ``
- ``AdjacencyList``
- ``BalancedTree``
- ``BarbellGraph``
- ``BetweennessCentrality``
- ``BinomialTree``
- ``ClosenessCentrality``
- ``CompleteGraph``
- ``CompleteKaryTree``
- ``ConnectedComponents``
- ``ConnectedGraphQ``
- ``CycleGraph``
- ``DegreeCentrality``
- ``DirectedEdge``
- ``DirectedGraphQ``
- ``EdgeAdd``
- ``EdgeConnectivity``
- ``EdgeCount``
- ``EdgeDelete``
- ``EdgeIndex``
- ``EdgeList``
- ``EdgeRules``
- ``EigenvectorCentrality``
- ``FindShortestPath``
- ``FindSpanningTree``
- ``FindVertexCut``
- ``FullRAryTree``
- ``Graph``
- ``GraphAtlas``
- ``GraphBox``
- ``GraphData``
- ``GraphDistance``
- ``HITSCentrality``
- ``HighlightGraph``
- ``HknHararyGraph``
- ``HmnHararyGraph``
- ``KaryTree``
- ``KatzCentrality``
- ``LadderGraph``
- ``LoopFreeGraphQ``
- ``MixedGraphQ``
- ``MultigraphQ``
- ``PageRankCentrality``
- ``PathGraph``
- ``PathGraphQ``
- ``PlanarGraphQ``
- ``Property``
- ``PropertyValue``
- ``RandomGraph``
- ``RandomTree``
- ``SimpleGraphQ``
- ``StarGraph``
- ``TreeGraph``
- ``TreeGraphQ``
- ``UndirectedEdge``
- ``VertexAdd``
- ``VertexConnectivity``
- ``VertexCount``
- ``VertexDegree``
- ``VertexDelete``
- ``VertexIndex``
- ``VertexList``
- ``WeaklyConnectedComponents``
GraphData names
----------------
- ``DodecahedralGraph``
- ``DiamondGraph``
- ``PappusGraph``
- ``IsohedralGraph``
- ``PetersenGraph``
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
----------------
- ``Circle``
- ``Diamond``
- ``Square``
- ``Star``
- ``Pentagon``
- ``Octagon``
- ``Hexagon``
- ``Triangle``