Research Article
Processing Uncertain RFID Data in Traceability Supply Chains
Algorithm 3
Build directed graph.
Input: , , | Output: directed graph, SEQ | Begin | For each record’s in STAY do | root node for ; | in parent’s children; | If node is NULL then | node; | node..loc; | node.; | node.; | Add node to parent’s children; | End if | Add node.path to PATH; | weight of the edge from parent to node; | Add to PATH; | End for | End |
|