bitwise operation
0
·
0
·
Optimise Adjacency Matrix Using Bitwise Operations in Tideman Algorithm
·2555 words·12 mins
tideman
graph theory
bitwise operation
adjacency list
adjacency matrix
C
summary
The adjacency matrix is a square matrix used to represent a finite graph in graph theory. However, it can be space-consuming for sparse graphs. This article incorporates bitwise operations into the application of the adjacency matrix in the Tideman voting algorithm and achieves O(n) and Ω(1) for finding the winners.