首页> 外国专利> SOLVING GRAPH ROUTES INTO A SET OF POSSIBLE RELATIONSHIP CHAINS

SOLVING GRAPH ROUTES INTO A SET OF POSSIBLE RELATIONSHIP CHAINS

机译:将图形路由求解成一组可能的关系链

摘要

Example embodiments relate to solve a graph route into a set of possible relationship chains. The example disclosed herein receives a graph route, identifies an edge expansion wildcard based on the graph route, expands the graph route into a plurality of sub-graph routes based on the edge expansion wildcard, solves the plurality of sub-graph routes in parallel into a plurality of sub-graph routes results, and joins the plurality of sub-graph routes results into a set of possible relationship chains.
机译:示例实施例涉及将图路由解成一组可能的关系链。本文公开的示例接收图路由,基于图路由识别边缘扩展通配符,基于边缘扩展通配符将图路由扩展为多个子图路由,将多个子图路由并行求解为多个子图路线结果,并将多个子图路线结果合并为一组可能的关系链。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号