XForms automated recalculation based on dynamic topological sorting
Feng Gao · Jisuanji gongcheng yu sheji · 2007
XForms,a W3C Recommendation,is called the next generation web forms.In XForms model,computation dependencies among instance data items can be represented as a directed acyclic graph(DAG).A dynamic topological sorting algorithm is presented,which maintains the topological order of a DAG and implements the recalculation of an XForms form automatically.The algorithm over-comes the problem of rebuilding the entire dependency digraph after additions and deletions of instance data item.Consequently,the efficiency of an XFroms computing engine is improved.