{"id":"W4245009066","doi":"10.1016/j.ipl.2003.07.005","title":"Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Topological sorting; Cover (algebra); Sorting; Directed acyclic graph; Algorithm; Node (physics); Bounded function; Mathematics; Computational complexity theory; Computer science; Combinatorics; Discrete mathematics","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.001553368,0.001111439,0.002221153,0.00662007,0.001938515,0.002593728,0.00348239,0.001664448,0.004789114],"category_scores_gemma":[0.007900411,0.0009117989,0.001175137,0.005951975,0.00107697,0.003986019,0.002559177,0.001968577,0.001324116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147414,"about_ca_system_score_gemma":0.005470211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009694192,"about_ca_topic_score_gemma":0.01609933,"domain_scores_codex":[0.9987478,0.0002158906,0.0001323328,0.0002542567,0.0004448763,0.0002047595],"domain_scores_gemma":[0.9949304,0.0026855,0.000366627,0.0008916036,0.000862042,0.0002638427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007679925,0.0004057307,0.002209121,0.000587654,0.0001187273,0.0001656578,0.0004160092,0.07270363,0.009403979,0.05095044,0.01774342,0.8445277],"study_design_scores_gemma":[0.0002447706,0.0002682489,0.0009557528,0.0000901528,0.0001335619,0.0003276664,0.0002597955,0.8576761,0.01563729,0.1104628,0.01386266,0.0000811847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03145603,0.0008712456,0.9586254,0.0005533091,0.0001208611,0.0003490091,0.001082814,0.004024348,0.002917005],"genre_scores_gemma":[0.1127867,0.0003577918,0.8806113,0.0001643345,0.00005013725,0.0002074179,0.002638129,0.0002408007,0.002943457],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009694192,"threshold_uncertainty_score":0.01927555,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01465455923753785,"score_gpt":0.2469811749659108,"score_spread":0.232326615728373,"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."}}