A collection of Python scripts to explore and visualize the B-Matrix of a graph network. Part of CPSC 547 (Information Visualization) 2022 at UBC.
-
Updated
Dec 23, 2022 - Python
A collection of Python scripts to explore and visualize the B-Matrix of a graph network. Part of CPSC 547 (Information Visualization) 2022 at UBC.
Implementation of three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.
Este repositorio es una colección de algoritmos de grafos que abordan diversos problemas, incluyendo la detección de comunidades en redes, la búsqueda de la ruta más corta y la identificación de cubiertas de k-cliques.
Add a description, image, and links to the clique-graph topic page so that developers can more easily learn about it.
To associate your repository with the clique-graph topic, visit your repo's landing page and select "manage topics."