Shortest path determination for large graphs
    1.
    发明授权
    Shortest path determination for large graphs 有权
    大图的最短路径确定

    公开(公告)号:US09500487B2

    公开(公告)日:2016-11-22

    申请号:US14491959

    申请日:2014-09-19

    Applicant: Apple Inc.

    Inventor: Alexander Tesov

    CPC classification number: G01C21/34 G01C21/3446 H04L45/12 H04L45/126

    Abstract: A computer-implemented method and system are provided for determining the shortest path between two nodes in a network comprising a plurality of nodes. A non-transitory computer-readable medium is also provided that includes a plurality of instructions that, when executed by at least one electronic device, at least cause the at least one electronic device to determine the shortest path between two nodes in a network comprising a plurality of nodes.

    Abstract translation: 提供了一种计算机实现的方法和系统,用于确定包括多个节点的网络中的两个节点之间的最短路径。 还提供了一种非暂时的计算机可读介质,其包括多个指令,当由至少一个电子设备执行时,至少使至少一个电子设备确定网络中的两个节点之间的最短路径,包括 多个节点。

    Frequency Based Transit Trip Characterizations
    2.
    发明申请
    Frequency Based Transit Trip Characterizations 审中-公开
    基于频率的运输特征

    公开(公告)号:US20160358469A1

    公开(公告)日:2016-12-08

    申请号:US14869684

    申请日:2015-09-29

    Applicant: Apple Inc.

    Abstract: Some embodiments provide a map application that identifies a transit route between a starting location and a destination. The transit route, in some embodiments, includes a set of transit legs that each is serviced by transit vehicles of a transit line. The map application of some embodiments, after identifying the transit route, categorizes each transit line of the transit route as one of a high frequency transit line and a low frequency transit line. The map application displays the departure schedules of high frequency transit lines in a first manner, while the map application displays the departure schedules of low frequency transit lines in a second different manner.

    Abstract translation: 一些实施例提供了识别起始位置和目的地之间的转接路线的地图应用。 在一些实施例中,过境路线包括一组运输腿,每条运输腿由运输线的运输车辆服务。 一些实施例的地图应用在识别过境路线之后,将过境路线的每条公交线分类为高频运输线和低频运输线之一。 地图应用程序以第一种方式显示高频运输线路的出发时间表,而地图应用以第二种不同的方式显示低频运输线路的出发时间表。

    SHORTEST PATH DETERMINATION FOR LARGE GRAPHS
    3.
    发明申请
    SHORTEST PATH DETERMINATION FOR LARGE GRAPHS 审中-公开
    最佳路线确定大图

    公开(公告)号:US20150081203A1

    公开(公告)日:2015-03-19

    申请号:US14491959

    申请日:2014-09-19

    Applicant: Apple Inc.

    Inventor: Alexander Tesov

    CPC classification number: G01C21/34 G01C21/3446 H04L45/12 H04L45/126

    Abstract: A computer-implemented method and system are provided for determining the shortest path between two nodes in a network comprising a plurality of nodes. A non-transitory computer-readable medium is also provided that includes a plurality of instructions that, when executed by at least one electronic device, at least cause the at least one electronic device to determine the shortest path between two nodes in a network comprising a plurality of nodes.

    Abstract translation: 提供了一种计算机实现的方法和系统,用于确定包括多个节点的网络中的两个节点之间的最短路径。 还提供了一种非暂时的计算机可读介质,其包括多个指令,当由至少一个电子设备执行时,至少使至少一个电子设备确定网络中的两个节点之间的最短路径,包括 多个节点。

    MAP APPLICATION WITH TRANSIT NAVIGATION MODE
    5.
    发明申请
    MAP APPLICATION WITH TRANSIT NAVIGATION MODE 审中-公开
    地图应用与交通导航模式

    公开(公告)号:US20160356603A1

    公开(公告)日:2016-12-08

    申请号:US14869403

    申请日:2015-09-29

    Applicant: Apple Inc.

    Abstract: Some embodiments provide a map application that receives a starting location and a destination location. The application then identifies several different transit routes from the starting location to the destination location based on a set of transit preferences. Each transit route includes a set of transit legs each of which is serviced by a different transit line. In some embodiments, the application ranks the identified transit routes based on a set of criteria, and displays a representation of a highest ranked transit route over a portion of a map presentation along with a set of information about the displayed transit route.

    Abstract translation: 一些实施例提供接收起始位置和目的地位置的地图应用程序。 然后,应用程序基于一组过境偏好来识别从起始位置到目的地位置的若干不同的过境路线。 每条过境路线都包括一组运输腿,每条路由不同的公交线路服务。 在一些实施例中,应用程序基于一组标准对所标识的转接路线进行排名,并且在地图显示的一部分上显示最高排名的转接路线的表示以及关于所显示的过境路线的一组信息。

    Shortest path determination for large graphs
    9.
    发明授权
    Shortest path determination for large graphs 有权
    大图的最短路径确定

    公开(公告)号:US08861506B2

    公开(公告)日:2014-10-14

    申请号:US13722723

    申请日:2012-12-20

    Applicant: Apple Inc.

    Inventor: Alexander Tesov

    CPC classification number: G01C21/34 G01C21/3446 H04L45/12 H04L45/126

    Abstract: A computer-implemented method and system are provided for determining the shortest path between two nodes in a network comprising a plurality of nodes. A non-transitory computer-readable medium is also provided that includes a plurality of instructions that, when executed by at least one electronic device, at least cause the at least one electronic device to determine the shortest path between two nodes in a network comprising a plurality of nodes.

    Abstract translation: 提供了一种计算机实现的方法和系统,用于确定包括多个节点的网络中的两个节点之间的最短路径。 还提供了一种非暂时的计算机可读介质,其包括多个指令,当由至少一个电子设备执行时,该指令至少使该至少一个电子设备确定网络中的两个节点之间的最短路径,包括 多个节点。

Patent Agency Ranking