首页>
外国专利>
Efficient egonet computation in a weighted directed graph
Efficient egonet computation in a weighted directed graph
展开▼
机译:加权有向图中的高效Egonet计算
展开▼
页面导航
摘要
著录项
相似文献
摘要
An embodiment of the invention pertains to a weighted directed graph comprising multiple nodes and edges that each extends between two nodes. The embodiment includes processing edges to generate a forward and reverse edge corresponding to each edge. Forward and reverse edges are processed to generate indirect edges, each comprising two edge components, and extending between two nodes. One node associated with each forward edge, each reverse edge, and each indirect edge is selected to be the key node of its associated edge. All forward, reverse and indirect edges having a particular node as their respective key nodes are placed into a group. All edges of the group are then selectively processed to provide information pertaining to an egonet of the graph that has the particular node as its egonode.
展开▼