When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 ...

  3. 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 ...

  4. Spacetime diagram - Wikipedia

    en.wikipedia.org/wiki/Spacetime_diagram

    Unlike a regular distance-time graph, the distance is displayed on the horizontal axis and time on the vertical axis. Additionally, the time and space units of measurement are chosen in such a way that an object moving at the speed of light is depicted as following a 45° angle to the diagram's axes.

  5. 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]

  6. Dijkstra's algorithm - Wikipedia

    en.wikipedia.org/wiki/Dijkstra's_algorithm

    Dijkstra's algorithm (/ ˈ d aɪ k s t r ə z / DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network.

  7. 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.

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

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

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us

  9. Hubble's law - Wikipedia

    en.wikipedia.org/wiki/Hubble's_law

    This value is the same throughout the universe for a given comoving time. D is the proper distance (which can change over time, unlike the comoving distance, which is constant) from the galaxy to the observer, measured in mega parsecs (Mpc), in the 3-space defined by given cosmological time. (Recession velocity is just v = dD/dt).