{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005349743,0.0006038809,0.0005519176,0.002264795,0.0007071755,0.001195732,0.0006680176,0.0005377679,0.004312869],"category_scores_gemma":[0.002691851,0.0002550582,0.0005034244,0.002559253,0.000377932,0.002659759,0.0004666325,0.0005555993,0.000898452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001060542,"about_ca_system_score_gemma":0.001497323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01170394,"about_ca_topic_score_gemma":0.005418637,"domain_scores_codex":[0.9990411,0.0001752183,0.0000457839,0.0001428036,0.0005087117,0.000086433],"domain_scores_gemma":[0.9994616,0.0001670224,0.00003922325,0.00003617911,0.0002813563,0.00001466401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001666221,0.00004768355,0.003573582,0.0004830717,0.000102184,0.0003178581,0.0003101024,0.4730626,0.01105953,0.1686855,0.0106444,0.3315469],"study_design_scores_gemma":[0.00001885804,0.00004477966,0.001033463,0.00004371774,0.00004448266,0.000256455,0.0001590104,0.8949604,0.007962997,0.06500838,0.03042295,0.00004451236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01367843,0.001395937,0.9737087,0.0002277097,0.00009726394,0.00007790686,0.0001587249,0.0005881395,0.01006715],"genre_scores_gemma":[0.4979567,0.005243011,0.4759512,0.0001196285,0.0001529962,0.0001957618,0.001443093,0.0004328759,0.01850489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01170394,"threshold_uncertainty_score":0.02327162,"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."}}