{"id":15998975,"url":"https://github.com/lidongze0629/grapham","last_synced_at":"2026-02-12T19:32:19.807Z","repository":{"id":105141698,"uuid":"136887553","full_name":"lidongze0629/GraphAM","owner":"lidongze0629","description":"A Graph Algorithm Management","archived":false,"fork":false,"pushed_at":"2018-06-21T08:17:51.000Z","size":109,"stargazers_count":2,"open_issues_count":3,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-08-18T23:42:50.915Z","etag":null,"topics":["algorithm","graph"],"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/lidongze0629.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":"2018-06-11T07:06:26.000Z","updated_at":"2021-07-27T11:51:15.000Z","dependencies_parsed_at":"2023-03-11T08:01:18.537Z","dependency_job_id":null,"html_url":"https://github.com/lidongze0629/GraphAM","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/lidongze0629/GraphAM","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lidongze0629%2FGraphAM","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lidongze0629%2FGraphAM/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lidongze0629%2FGraphAM/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lidongze0629%2FGraphAM/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lidongze0629","download_url":"https://codeload.github.com/lidongze0629/GraphAM/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lidongze0629%2FGraphAM/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29378819,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-12T19:05:20.189Z","status":"ssl_error","status_checked_at":"2026-02-12T19:01:44.216Z","response_time":55,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithm","graph"],"created_at":"2024-10-08T08:23:15.628Z","updated_at":"2026-02-12T19:32:19.793Z","avatar_url":"https://github.com/lidongze0629.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GraphAM\nGraphAM, a graph platform to provide c++ API to run graph algorithm.It incorporates various high level graph algorithms such as Single Source Shortest Path(SSSP) to deliver high performance experience.\n\n# Prerequisite\nThese codes are implemented and tested with cmake\u003e=2.8, boost, glog and gflags \u003cbr\u003e\nwith ubuntu16.04, install glog and gflags is rather simple, just use `apt-get`\n```\nsudo apt-get update\nsudo apt-get install -y libgoogle-glog-dev libgflags-dev libboost-all-dev\n```\n# Algorithm\n#### [Single Source Shortest Path](https://en.wikipedia.org/wiki/Shortest_path_problem#Single-source_shortest_paths)\n#### [Weakly Connected Component](http://mathworld.wolfram.com/WeaklyConnectedComponent.html)\n#### [Prim's Minimum Spanning Tree](https://en.wikipedia.org/wiki/Prim%27s_algorithm)\n#### [Breadth-first search](https://en.wikipedia.org/wiki/Breadth-first_search)\n#### [PageRank](https://en.wikipedia.org/wiki/PageRank)\n\n# compile and Install\n```\ngit clone \u003cthis-repository\u003e\ncd GraphAM\nmkdir build \u0026\u0026 cd build\ncmake .. \u0026\u0026 make -j4\n```\n\n# How to run\n## Prepare DataSet\n### vertex file format\n```\n# each vertex in one line\n# with format: v_id, followd its value\n0   10\n1   73\n2   23\n3   8\n4   98\n```\n### edge file format\n```\n# Undirected graph\n# each edge in one line\n# with format: src_id dst_id, followd its value\n0   1   28\n1   4   38\n33  23  22\n82  22  11\n28  28  10\n```\n\n##  Run Command\n```\n./graph-engine --vfile \u003cpath-to-your-point-file\u003e --efile \u003cpath-to-your-edge-file\u003e --query \u003cyou-algorithm-query\u003e --algo_dynamic_lib \u003cthe-dynamic-library-name-of-algorithm\u003e --output \u003cthe-result-output-path\u003e\n\n- with sssp algorithm\n./graph-engine --vfile ./graph_test/twitter.v --efile ./graph_test/twitter.e --query (4) --algo_dynamic_lib libapp_sssp.so --output ./\n```\n\n### Run algorithm test\n```\n# make sure you are in build directory\n../misc/run_and_test.sh\n```\n\n## 关于作者\n\n```javascript\n  var dzl = {\n    name  : \"王者荣耀\",\n    site : \"http://pvp.qq.com\"\n  }\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flidongze0629%2Fgrapham","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flidongze0629%2Fgrapham","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flidongze0629%2Fgrapham/lists"}