• We just launched and are currently in beta. Join us as we build and grow the community.

Check Number of Self-loop & Parallel Edges From Adjacency Matrix

LeakPortal

Crypto Innovation Architect
L Rep
0
0
0
Rep
0
L Vouches
0
0
0
Vouches
0
Posts
161
Likes
124
Bits
2 MONTHS
2 2 MONTHS OF SERVICE
LEVEL 1 200 XP
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests that how many self-loop & parallel edges are contained in the graph represented by the adjacency matrix. Also it checks that which vertices contain only self-loop. Self-loop is an edge which has the same initial & termination point.

Note: Due to the size or complexity of this submission, the author has submitted it as a .zip file to shorten your download time. After downloading it, you will need a program like Winzip to decompress it.

Virus note: All files are scanned once-a-day by SourceCodester.com for viruses, but new viruses come out every day, so no prevention program can catch 100% of them.

FOR YOUR OWN SAFETY, PLEASE:

1. Re-scan downloaded files using your personal virus checker before using it.

2. NEVER, EVER run compiled files (.exe's, .ocx's, .dll's etc.)--only run source code.

 

442,401

317,942

317,951

Top