scc
Here are 88 public repositories matching this topic...
Search Strong Connected Components
-
Updated
Mar 22, 2017 - JavaScript
A Class for Reading information from wikipedia and parsing it as an SCC
-
Updated
Jul 9, 2017 - Java
Stanford Algorithm Design and Analysis Implementation in R
-
Updated
Aug 9, 2017 - R
C++ library for finding Strongly Connected Components in parallel, based on paper: https://dl.acm.org/citation.cfm?id=2851161
-
Updated
May 22, 2018 - C++
Graph Theory project by Stamatics
-
Updated
Jul 27, 2018 - TeX
Graph Theory Algorithm is implemented in python. Jupyter Notebook is used to demonstrate the concept and Networkx library is used in several algorithms to visualize the graph.
-
Updated
Oct 15, 2018 - Jupyter Notebook
Amateur concept of articulation points in both undirected and directed graphs
-
Updated
Mar 19, 2019 - C++
Study, implementation and comparison of different algorithms for finding the Strongly Connected Components of a directed graph.
-
Updated
Sep 22, 2019 - C++
Strongly connected component algorithm implementation
-
Updated
Nov 12, 2019 - Python
Strongly Connected Components of a Graph
-
Updated
Apr 13, 2020 - Prolog
DGraph is a system for directed graph processing with taking advantage of the strongly connected component structure. On this system, most graph partitions are able to reach convergence in order and need to be loaded into the main memory for exactly once, getting much lower data access cost and faster convergence.
-
Updated
Oct 13, 2020 - C++
Improve this page
Add a description, image, and links to the scc topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the scc topic, visit your repo's landing page and select "manage topics."