{"id":19413717,"url":"https://github.com/vaneeza-7/data-structures-assignments","last_synced_at":"2025-04-24T12:31:42.705Z","repository":{"id":157659597,"uuid":"545269314","full_name":"Vaneeza-7/Data-structures-assignments","owner":"Vaneeza-7","description":"Data Structures: Arrays, Stacks, Queues, Graphs applications in image processing, tag parsing and routes/maps respectively.","archived":true,"fork":false,"pushed_at":"2023-02-12T03:00:20.000Z","size":38,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-25T02:45:53.886Z","etag":null,"topics":["all-pairs-shortest-path","connected-component-labelling","dice-coefficient","dijkstra-algorithm","error-detection","expression-parser","graphs","infix-notation","infix-to-postfix","kmeans-clustering","least-recently-used-algorithm","object-detection","opencv","postfix-notation","prefix-notation","queues","run-length-encoding","second-shortest-path","stacks","tag-parsing"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Vaneeza-7.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2022-10-04T04:19:48.000Z","updated_at":"2024-02-25T03:26:21.000Z","dependencies_parsed_at":null,"dependency_job_id":"ace0b34a-2956-471c-952b-3ad1c158b349","html_url":"https://github.com/Vaneeza-7/Data-structures-assignments","commit_stats":null,"previous_names":["vaneeza-7/data-structures-assignments","vaneeza-7/data-structs-assignments"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FData-structures-assignments","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FData-structures-assignments/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FData-structures-assignments/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FData-structures-assignments/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vaneeza-7","download_url":"https://codeload.github.com/Vaneeza-7/Data-structures-assignments/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250628804,"owners_count":21461690,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["all-pairs-shortest-path","connected-component-labelling","dice-coefficient","dijkstra-algorithm","error-detection","expression-parser","graphs","infix-notation","infix-to-postfix","kmeans-clustering","least-recently-used-algorithm","object-detection","opencv","postfix-notation","prefix-notation","queues","run-length-encoding","second-shortest-path","stacks","tag-parsing"],"created_at":"2024-11-10T12:34:42.293Z","updated_at":"2025-04-24T12:31:42.693Z","avatar_url":"https://github.com/Vaneeza-7.png","language":"C++","readme":"# Data-structs-assignments\nData Structures: Arrays, Stacks, Queues, Graphs applications in image processing, tag parsing and routes/maps respectively.\n\u003cbr\u003eASSIGNMENT 1: IMAGE PROCESSING WITH OPENCV USING ARRAYS \u0026 LISTS\u003cbr\u003e\n\u003ci\u003eContents:\u003c/i\u003e\n\u003cul\u003etask1.h | Connected Componenets Labelling \u003cbr\u003e\ntask2.h | K-means clustering\u003cbr\u003e\ntask3.h | Dice Coefficient\u003cbr\u003e\ntask4.h | Run-length encoding\u003cbr\u003e\n\u003c/ul\u003e\nASSIGNMENT 2: TAG AND EXPRESSION PARSING USING STACKS \u0026 QUEUES\u003cbr\u003e\n\u003ci\u003eContents:\u003c/i\u003e \u003cbr\u003e\n\u003cul\u003eparsing.h | Tag parsing \u0026 Error detection \u003cbr\u003e\nlru.h | Least recently used \u003cbr\u003e\nsource.cpp | Postfix, Prefix, Infix conversions \u003cbr\u003e\n\u003c/ul\u003e\nASSIGNMENT 3: SHORTEST PATHS AND ALTERNATE ROUTES USING GRAPHS\u003cbr\u003e\n\u003ci\u003eContents:\u003c/i\u003e \u003cbr\u003e\n\u003cul\u003eHeader.h | Dijkstra's shortest path from one to all, all to one, between pairs and second shortest path \u003cbr\u003e\nGraphData.csv | Graph adjacency matrix file \u003cbr\u003e\ntest.cpp | Test cases \u003cbr\u003e\n\u003c/ul\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvaneeza-7%2Fdata-structures-assignments","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvaneeza-7%2Fdata-structures-assignments","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvaneeza-7%2Fdata-structures-assignments/lists"}