When.com Web Search

  1. Ad

    related to: distance time graph calculator free

Search results

  1. Results From The WOW.Com Content Network
  2. Time–distance diagram - Wikipedia

    en.wikipedia.org/wiki/Timedistance_diagram

    A time–distance diagram is a chart with two axes: one for time, the other for location. The units on either axis depend on the type of project: time can be expressed in minutes (for overnight construction of railroad modification projects such as the installation of switches) or years (for large construction projects); the location can be (kilo)meters, or other distinct units (such as ...

  3. Distance matrix - Wikipedia

    en.wikipedia.org/wiki/Distance_matrix

    In general, a distance matrix is a weighted adjacency matrix of some graph. In a network, a directed graph with weights assigned to the arcs, the distance between two nodes of the network can be defined as the minimum of the sums of the weights on the shortest paths joining the two nodes (where the number of steps in the path is bounded). [2]

  4. Distance (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Distance_(graph_theory)

    A metric space defined over a set of points in terms of distances in a graph defined over the set is called a graph metric. The vertex set (of an undirected graph) and the distance function form a metric space, if and only if the graph is connected. The eccentricity ϵ(v) of a vertex v is the greatest distance between v and any other vertex; in ...

  5. Desmos - Wikipedia

    en.wikipedia.org/wiki/Desmos

    In it, geometrical shapes can be made, as well as expressions from the normal graphing calculator, with extra features. [8] In September 2023, Desmos released a beta for a 3D calculator, which added features on top of the 2D calculator, including cross products, partial derivatives and double-variable parametric equations. [9]

  6. Shortest path problem - Wikipedia

    en.wikipedia.org/wiki/Shortest_path_problem

    Shortest path (A, C, E, D, F) between vertices A and F in the weighted directed graph. In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

  7. File:Distance-time graph example.svg - Wikipedia

    en.wikipedia.org/wiki/File:Distance-time_graph...

    English: An example distance-time graph. Date: 25 March 2008: Source: Own work: Author: Sjlegg at English Wikibooks: Permission (Reusing this file) Public domain ...

  8. Travel-time curve - Wikipedia

    en.wikipedia.org/wiki/Travel-time_curve

    Travel-time curve is a graph showing the relationship between the distance from the epicenter to the observation point and the travel time. [2] [3] Travel-time curve is drawn when the vertical axis of the graph is the travel time and the horizontal axis is the epicenter distance of each observation point. [4] [5] [6]

  9. Fréchet distance - Wikipedia

    en.wikipedia.org/wiki/Fréchet_distance

    Free-space diagram of the red and the blue curve. In contrast to the definition in the text, which uses the parameter interval [0,1] for both curves, the curves are parameterized by arc length in this example. An important tool for calculating the Fréchet distance of two curves is the free-space diagram, which was introduced by Alt and Godau. [4]