This package is for graph classes recognisation.
Project description
Check Graph
You can use this package for recognition of various graph classes.
We made python library for graph classes recognition algorithm which takes directed or undirected graph as input and provides recognition of particular graph which mentioned earlier in terms of true or false.
Click here to view this project on pypi.org
Installation
pip install checkgraph
Usage
Use Run function for taking input and calling every methods:
import check_graph as cg
cg.run()
For custom run, you have to create a graph using check_graph library:
import check_graph as cg
graph = cg.Graph()
And then you can set numbers of nodes and edges as you want::
graph.setNodes(5)
graph.setEdges(4)
You can add Edge between two nodes using below method::
graph.addEdge(1,2)
graph.addEdge(2,3)
graph.addEdge(3,4)
graph.addEdge(4,5)
Methods
You can use below methods for recognition of various Graph classes.
 Return types of following methods are True/False:
graph.isSimpleGraph()
graph.isMultiGraph()
graph.isEdgeLessGraph()
graph.isCubicGraph()
graph.isBipartedGraph()
graph.isCycleGraph()
graph.isWheelGraph()
graph.isStarGraph()
graph.isCompleteGraph()
graph.isCyclicGraph()
graph.isConnectedGraph()
graph.isStronglyConnectedGraph()
graph.isTreeGraph()
graph.isForestGraph()
graph.isRooksGraph()
graph.isCompleteBipartedGraph()
graph.isThresholdGraph()
graph.isPlanarGraph()
graph.isMultiPartiteGraph()
graph.isCompleteMultiPartitieGraph()
graph.isPaleyGraph()
graph.isCubeGraph()
graph.isHararyGraph()
graph.isKneserGraph()
graph.isJohnsonGraph()
graph.isHammingGraph()
graph.isChordalGraph()
graph.isMooreGraph()
graph.isLineGraph()
graph.isSplitGraph()
graph.isColorCriticalGraph()
 Return type of following method is Integer(If it is Regular Graph then it will return Degree,otherwise it will return 1):
graph.isRegularGraph(True) # If argument is True then it will print details otherwise not.

Return type of following method is Triplet(If it is Strongly Regular Graph then it will return Degree,Lemmda and MU otherwise it will return 1):
graph.isStronglyRegularGraph(True) # If argument is True then it will print details otherwise not.

Return type of following method is list of Maximal Clique:
cliques = graph.getCliques()
 Return type of following method is integer which is chromatic number of graph:
ch = graph.getChromaticNumber()
 Return type of following method is list of color of every node:
colors = graph.getColors()
Authors
License
This project is licensed under the MIT License  see the LICENSE file for details
Thanks ❤
Project details
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Filename, size  File type  Python version  Upload date  Hashes 

Filename, size check_graph1.0.2py3noneany.whl (9.6 kB)  File type Wheel  Python version py3  Upload date  Hashes View hashes 
Filename, size check_graph1.0.2.tar.gz (10.0 kB)  File type Source  Python version None  Upload date  Hashes View hashes 
Hashes for check_graph1.0.2py3noneany.whl
Algorithm  Hash digest  

SHA256  009c7385a3c2a44b4ddac44d545797bf0d3684861bf03c6d431f47589f40b452 

MD5  4f2dc952dd21fae1d1bf2a8cb8e205fe 

BLAKE2256  3505cb9f59c8947d27406fd01926d6016cec0ead8a6dd6bef926057fd17a1274 