{"id":"W4255497863","doi":"10.1007/978-3-319-70151-6_5","title":"Graphs and Trees","year":2018,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Combinatorics; Breadth-first search; Mathematics; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000201256,0.0008960061,0.0005748637,0.001767862,0.001112981,0.003187454,0.0007931344,0.0009268713,0.06268179],"category_scores_gemma":[0.0009881073,0.0003839321,0.0003677931,0.003136037,0.001682367,0.00395392,0.001299747,0.002290484,0.02594594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001559645,"about_ca_system_score_gemma":0.0008999007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001516881,"about_ca_topic_score_gemma":0.003223832,"domain_scores_codex":[0.9997492,0.0000582752,0.000006507523,0.00005486528,0.0001034068,0.00002764662],"domain_scores_gemma":[0.9997393,0.0001032564,0.00001402266,0.00004736609,0.00005149761,0.00004447935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007560397,0.00002002405,0.00007323523,0.0001841432,0.000006985199,0.0000276112,0.0003028785,0.0005340386,0.0002871725,0.6344616,0.2710308,0.093064],"study_design_scores_gemma":[0.000002495857,0.000004990497,0.0001226225,0.0001106395,0.0000038301,0.00005083234,0.0001026409,0.0002774946,0.00008066337,0.3087891,0.6904508,0.000003822743],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002044878,0.04976958,0.01780516,0.007052433,0.005248067,0.00004238622,0.0003809681,0.0003843884,0.9172722],"genre_scores_gemma":[0.03244894,0.04375622,0.009729804,0.002824428,0.004400294,0.00009776999,0.0006804119,0.0005437033,0.9055184],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.06268179,"threshold_uncertainty_score":0.2096915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01808639222079604,"score_gpt":0.2351433232438299,"score_spread":0.2170569310230339,"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."}}