graphalgorithm

There are 12 repositories under graphalgorithm topic.

  • yang-db

    YANG-DB/yang-db

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

    Language:Java10061055
  • iamsinghrajat/Friends-Recommender-In-Social-Network

    Friends Recommendation and Link Prediction in Social Netowork

    Language:Jupyter Notebook470016
  • RosaUlisses/UGraph-Library

    A C# open source graph library

    Language:C#132141
  • 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++4102
  • ahmedengu/VisuAlgo-GraphColoring

    WelshPowell algorithm animated with VisuAlgo

    Language:JavaScript3201
  • rostam/CGTea

    A mini-version of GTea written in C++

    Language:C++2300
  • BrettCleary/AlgosPP

    C++ Algorithms Library

    Language:C++1100
  • IRatajczyk/GraphDecomposition

    Graph decomposition algorithm for Graph Theory classes @ UST AGH.

    Language:Python1201
  • tashi-2004/Efficient-Graph-Algorithms

    A C++ implementation of a weighted graph using an adjacency matrix. 📊 Features include vertex and edge management, shortest distance calculation with Dijkstra's algorithm 🛤️, and adjacency matrix visualization. 📈 Robust error handling included. 🚨 Install by including weighted_graph.h and using the provided skeleton files for testing. 📝

    Language:C++00
  • yahiyamansuri14/Graph-CPP

    Graph DataStructure and algorithms implemented using cpp

    Language:C++20