More Problems

• Write a program to calculate the minimum spanning tree using Kruskals algorithm with an adjacency matrix.
• Write a program to compute the weighted adjacency matrix from a graph with weights on edges.
• Write a program to check for the existence of a Hamiltonian cycle in a graph using its adjacency matrix.
• Write a program to check for the existence of an Eulerian path in a graph using its adjacency matrix.
• Write a program to compute the Hamming distance between two matrices.
• Write a program to compute the Levenshtein distance between two matrices.
• Write a program to compute the Jaccard similarity between two matrices.
• Write a program to perform matrix factorization using the Non-negative Matrix Factorization (NMF) algorithm.