{"id":"W2348117608","doi":"","title":"Analysis of the Shortest Route in Network on Dijkstra Algorithm","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Web Applications and Data Management","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Dijkstra's algorithm; Computer science; Algorithm; Pathfinding; Yen's algorithm; K shortest path routing; A* search algorithm; Shortest Path Faster Algorithm; Floyd–Warshall algorithm; Suurballe's algorithm; Shortest path problem; Process (computing); Theoretical computer science; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001672423,0.0001191252,0.0001788983,0.000207685,0.0001242186,0.00008406588,0.001607095,0.00003675983,0.000003343685],"category_scores_gemma":[2.594304e-7,0.00009565846,0.0001263254,0.003576645,0.00004436459,0.0001218226,0.0004675174,0.0001082621,0.00002855815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008065179,"about_ca_system_score_gemma":0.00004186893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001179052,"about_ca_topic_score_gemma":0.0001142241,"domain_scores_codex":[0.9988453,0.00002158613,0.0003247057,0.0004339786,0.0001633447,0.0002110633],"domain_scores_gemma":[0.9984708,0.00004214498,0.0001151228,0.001289212,0.00004127842,0.00004145995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[6.670845e-7,0.000445354,0.002784093,0.000004641354,0.0001725489,7.654479e-7,0.0001483093,0.1760522,0.0001273532,0.4629193,0.0006372912,0.3567075],"study_design_scores_gemma":[0.0006828013,0.00004290205,0.4821523,0.00004043747,0.0002362021,0.000003571973,0.00001697726,0.154965,0.0008730433,0.01688443,0.3436466,0.0004557025],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001655599,0.00002806945,0.9955096,0.001309092,0.00001572283,0.0006170222,0.00003108426,0.00005357596,0.0007801911],"genre_scores_gemma":[0.3145754,0.0000154374,0.683562,0.00102204,0.00008665572,0.0006067355,0.00006740473,0.000009574118,0.00005472056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4793682,"threshold_uncertainty_score":0.3900838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007216271613167893,"score_gpt":0.2257318264977807,"score_spread":0.2185155548846128,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}