MétaCan
Menu
Back to cohort
Record W2348117608

Analysis of the Shortest Route in Network on Dijkstra Algorithm

2004· article· en· W2348117608 on OpenAlexvenueno aff
Liu Wei-qun

Bibliographic record

VenueMicrocomputer applications · 2004
Typearticle
Languageen
FieldComputer Science
TopicWeb Applications and Data Management
Canadian institutionsnot available
Fundersnot available
KeywordsDijkstra's algorithmComputer scienceAlgorithmPathfindingYen's algorithmK shortest path routingA* search algorithmShortest Path Faster AlgorithmFloyd–Warshall algorithmSuurballe's algorithmShortest path problemProcess (computing)Theoretical computer scienceGraph
DOInot available

Abstract

fetched live from OpenAlex

The shortest route analysis is one of the fundamental functions in network analysis. Dijkstra Algorithm is an acknowledged better algorithm of shortest route.In this paper, Dijkstra algorithm is modified by using binary tree structure through analyzing Dijkstra Algorithm's executing speed,which has optimized the calculation process in some degree and improved the efficiency of analysis.This algorithm is feasible by testing some data.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.012
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.003
Science and technology studies0.0010.000
Scholarly communication0.0010.003
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.226
Teacher spread0.219 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations6
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicWeb Applications and Data ManagementFrench-language works237,207