GitHub topics: graphalgorithm

Repositories

rostam/CGTea

A mini-version of GTea written in C++

Language: C++ - Size: 271 KB - Last synced at: 25 days ago - Pushed at: 25 days ago - Stars: 2 - Forks: 0

Critical Task is a Project Dependency Scheduler is a Java-based application designed to create project schedules, identify task dependencies, and find the critical path of a project. This repository contains the source code and necessary files to build and run the application.

Language: Java - Size: 64.5 KB - Last synced at: 4 months ago - Pushed at: 4 months ago - Stars: 0 - Forks: 0

YANG-DB/yang-db

YANGDB Open-source, Scalable, Non-native Graph database (Powered by Elasticsearch)

Language: Java - Size: 175 MB - Last synced at: 14 days ago - Pushed at: 6 months ago - Stars: 102 - Forks: 5

iamsinghrajat/Friends-Recommender-In-Social-Network

Friends Recommendation and Link Prediction in Social Netowork

Language: Jupyter Notebook - Size: 228 KB - Last synced at: about 1 year ago - Pushed at: about 4 years ago - Stars: 45 - Forks: 16

RosaUlisses/UGraph-Library

A C# open source graph library

Language: C# - Size: 96.7 KB - Last synced at: about 1 month ago - Pushed at: over 2 years ago - Stars: 13 - Forks: 1

IRatajczyk/GraphDecomposition

Graph decomposition algorithm for Graph Theory classes @ UST AGH.

Language: Python - Size: 697 KB - Last synced at: about 2 years ago - Pushed at: over 2 years ago - Stars: 1 - Forks: 1

AndrewZzz24/Algorithms-and-Data-Structures

Practice Tasks

Language: C++ - Size: 1.14 MB - Last synced at: about 2 years ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 0

ahmedengu/VisuAlgo-GraphColoring

WelshPowell algorithm animated with VisuAlgo

Language: JavaScript - Size: 826 KB - Last synced at: over 2 years ago - Pushed at: almost 5 years ago - Stars: 1 - Forks: 1

SourangshuGhosh/Reverse-Cuthill-McKee-Ordering-in-C

RCM is a C++ library which computes the Reverse Cuthill McKee ("RCM") ordering of the nodes of a graph. The RCM ordering is frequently used when a matrix is to be generated whose rows and columns are numbered according to the numbering of the nodes. By an appropriate renumbering of the nodes, it is often possible to produce a matrix with a much smaller bandwidth.The bandwidth of a matrix is computed as the maximum bandwidth of each row of the matrix. The bandwidth of a row of the matrix is essentially the number of matrix entries between the first and last nonzero entries in the row, with the proviso that the diagonal entry is always treated as though it were nonzero.This library includes a few routines to handle the common case where the connectivity can be described in terms of a triangulation of the nodes, that is, a grouping of the nodes into sets of 3-node or 6-node triangles. The natural description of a triangulation is simply a listing of the nodes that make up each triangle. The library includes routines for determining the adjacency structure associated with a triangulation, and the test problems include examples of how the nodes in a triangulation can be relabeled with the RCM permutation.

Language: C++ - Size: 46.9 KB - Last synced at: over 2 years ago - Pushed at: almost 5 years ago - Stars: 4 - Forks: 1