The most credible path algorithm on broadcast

Broadcasting message via the social web, people always hope that the message goes through the most credible path, and would like to know trustworthiness on the most credible path and the least credible path. To solve these problems, this article defines the concepts related to the most credible path and the least credible path for single-source broadcast. Proposes algorithms on the most credible path and the least credible path, quantifies the trustworthiness of the most credible path and the least credible path. Analysis shows that the two algorithms have polynomial time complexity. Typical applications show that the most credible path algorithm on single-source broadcast have an important practical value, which enhances the security of the message broadcast.