{"id":20642551,"url":"https://github.com/aditeyabaral/dml-assignment-ue18cs205","last_synced_at":"2026-06-10T09:31:33.869Z","repository":{"id":116761228,"uuid":"256303781","full_name":"aditeyabaral/DML-Assignment-UE18CS205","owner":"aditeyabaral","description":"A repository containing the source code for the Graph Network Assignment given as a part of the Discrete Mathematics and Logic course (UE18CS205) at PES University. The objective of the assignment was to profile a graph and verify certain properties.","archived":false,"fork":false,"pushed_at":"2020-04-17T04:21:53.000Z","size":9,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-09T13:11:17.514Z","etag":null,"topics":["c","data-structures","discrete-math","discrete-mathematics","graph","graph-algorithms","graphs-theory","logic-programming"],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aditeyabaral.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-04-16T18:57:45.000Z","updated_at":"2020-08-07T05:26:50.000Z","dependencies_parsed_at":null,"dependency_job_id":"646c40a4-1552-4cbe-a3e9-b815dac9f175","html_url":"https://github.com/aditeyabaral/DML-Assignment-UE18CS205","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/aditeyabaral/DML-Assignment-UE18CS205","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aditeyabaral%2FDML-Assignment-UE18CS205","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aditeyabaral%2FDML-Assignment-UE18CS205/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aditeyabaral%2FDML-Assignment-UE18CS205/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aditeyabaral%2FDML-Assignment-UE18CS205/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aditeyabaral","download_url":"https://codeload.github.com/aditeyabaral/DML-Assignment-UE18CS205/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aditeyabaral%2FDML-Assignment-UE18CS205/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34146871,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-10T02:00:07.152Z","response_time":89,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c","data-structures","discrete-math","discrete-mathematics","graph","graph-algorithms","graphs-theory","logic-programming"],"created_at":"2024-11-16T16:09:25.228Z","updated_at":"2026-06-10T09:31:33.405Z","avatar_url":"https://github.com/aditeyabaral.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DML-Assignment-UE18CS205\nA repository containing the source code for the Graph Network Assignment given as a part of the Discrete Mathematics and Logic course (UE18CS205) at PES University. The objective of the assignment was to profile a graph and verify certain properties such as: \n\n* What is average degree of a vertex in the graph?\n* Is the graph a regular graph?\n* Is the graph a complete graph?\n* Is the graph a cycle graph?\n* Is the graph a path graph but not a cycle graph?\n* Does the graph have an Euler circuit?\n* Does the graph have an Euler path but not an Euler circuit?\n* Does the graph satisfy the sufficient condition of the Ore's theorem?\n\n*The assignment questions can also be found in Problem Statement.txt*\n\n# Compilation\n\nTo compile, use the followng command:  \n\n```gcc -Wall graphprofile_test.c PES1201800366.c```\n\nExecute with input redirection using: \n\n```./a.out \u003c sample_test.txt```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faditeyabaral%2Fdml-assignment-ue18cs205","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faditeyabaral%2Fdml-assignment-ue18cs205","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faditeyabaral%2Fdml-assignment-ue18cs205/lists"}