https://github.com/d-k-e/graph-analysis

A repo on analysis of graphs as in graph theory

https://github.com/d-k-e/graph-analysis

Science Score: 26.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
    Found .zenodo.json file
  • DOI references
  • Academic publication links
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (6.6%) to scientific vocabulary

Keywords

graph-analysis graph-theory graph-theory-analysis graphml nim-lang
Last synced: 5 months ago · JSON representation

Repository

A repo on analysis of graphs as in graph theory

Basic Info
  • Host: GitHub
  • Owner: D-K-E
  • License: gpl-3.0
  • Language: Nim
  • Default Branch: master
  • Size: 272 KB
Statistics
  • Stars: 1
  • Watchers: 3
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Topics
graph-analysis graph-theory graph-theory-analysis graphml nim-lang
Created over 6 years ago · Last pushed over 6 years ago
Metadata Files
Readme License

README.rst

################
Graph Analysis
################

.. image:: https://travis-ci.com/D-K-E/graph-analysis.svg?branch=master
    :target: https://travis-ci.com/D-K-E/graph-analysis

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.

Owner

  • Name: DKE
  • Login: D-K-E
  • Kind: user
  • Location: Osaka

Are you cola ?

GitHub Events

Total
Last Year