A repo on analysis of graphs as in graph theory.
The goal is to concentrate on analysis rather than io. A small subset of GraphML format is assumed for specification of graphs. You can find a sample of it in tests folder. All graphs are immutable once they are created. Functions are going to be documented and referenced as they are added. Very experimental stuff. Check if a function is tested before adopting it from tests directory.
Currently almost all functionality deals with undirected graphs.
Here are the current set of functions defined in analyzer that are tested:
- find order
- find the number of vertices
- find the number of edges
- get edge set for a given vertex from a graph
- check if a graph is complete: all vertices are pairwise adjacent
- check if a given graph is a proper subgraph of another graph
- check if a given graph is a subgraph of another graph
- check if a given subgraph is an induced subgraph of the graph
- given a vertex set, get the graph H that is being spanned by the vertex set in graph G.
- Hypergraph structure is also added. Some extensions to graphml for dealing with directed hypergraphs are also added, see graphs folder in tests.