GitHub - levongh/graph: In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.

levongh / graph Public

In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.

4 stars 1 fork Branches Tags Activity

Star

Notifications

1 Branch 0 Tags

Name	Name	Last commit message	Last commit date
Latest commit levongh added adjacency implementation Feb 14, 2021 30fe01a · Feb 14, 2021 History 50 Commits
include	include	added adjacency implementation	Feb 14, 2021
input	input	Add files via upload	Apr 10, 2017
src	src	minor changes	Aug 25, 2020
.gitignore	.gitignore	changed gitignore file	Jul 11, 2019
makefile	makefile	change makefile structure	Jun 3, 2019