ldacs-dijkstra
Science Score: 67.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
✓DOI references
Found 3 DOI reference(s) in README -
✓Academic publication links
Links to: zenodo.org -
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (3.8%) to scientific vocabulary
Last synced: 6 months ago
·
JSON representation
·
Repository
Basic Info
- Host: GitHub
- Owner: ComNetsHH
- License: lgpl-3.0
- Language: C++
- Default Branch: main
- Size: 26.4 KB
Statistics
- Stars: 1
- Watchers: 4
- Forks: 0
- Open Issues: 0
- Releases: 4
Created over 1 year ago
· Last pushed over 1 year ago
Metadata Files
Readme
License
Citation
README.md
LDACS-Dijkstra
Overview
LDACS-Dijkstra is a component of the LDACS-Greedy-K-Hop-Simulator project. It implements Dijkstra's shortest path routing and is used as an upper bound for PDR in the simulation
Installation
Clone the repository and follow the setup instructions:
bash
git clone https://github.com/ComNetsHH/LDACS-Dijkstra.git
cd LDACS-Dijkstra/simulation
make build-releases
Owner
- Name: Institute of Communication Networks
- Login: ComNetsHH
- Kind: organization
- Location: Hamburg, Germany
- Website: https://www.tuhh.de/comnets
- Repositories: 41
- Profile: https://github.com/ComNetsHH
Institute of Communication Networks (ComNets) at Hamburg University of Technology (TUHH)
Citation (CITATION.cff)
cff-version: 1.2.0
message: "If you use this software, please cite it as below."
authors:
- family-names: Ahmed
given-names: Musab
orcid: https://orcid.org/0000-0001-5554-3414
- family-names: Maji
given-names: Sohini
title: "LDACS Dijkstra"
version: 1.0.3
doi:
date-released: 2024-07-25
GitHub Events
Total
- Watch event: 2
Last Year
- Watch event: 2