diff --git a/sandbox/index.html b/sandbox/index.html index 9a9a088..2d979a1 100644 --- a/sandbox/index.html +++ b/sandbox/index.html @@ -37,6 +37,7 @@ + @@ -187,6 +188,8 @@
  • + + @@ -604,7 +607,62 @@

    Search graph radius and diameter

    Find shortest path using Dijkstra's algorithm

    Calculate vertexes degree

    - + +

    Weight of minimum spanning tree is

    +

    In time of calculation we have ignored the edges direction.

    +

    Graph is disconnected

    + + +

    Select first graph for isomorphic check. Click to any node of graph

    +

    Select second graph for isomorphic check. Click to any node of graph

    +

    Select a template graph by clicking to any node of graph

    +

    Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph

    +

    Graphs are isomorphic

    +

    Graphs are not isomorphic

    +

    Number of isomorphic subgraphs are

    +

    Graph doesn't contain isomorphic subgraphs

    +

    Search isomorphic subgraphs

    +

    Isomorphic subgraph #

    +

    To use the algorithm, you need to create 2 separate graphs

    +

    Check Graphs Isomorphism

    + + +

    Graph is disconnected

    +

    Graph contains only one vertex

    +

    Graph radius

    +

    Graph diameter

    +

    Central

    +

    Peripheral

    + + +

    The maximum degree of a graph is

    + + +

    Color number is

    + +

    Done

    + +

    Actions

    +

    Common edge style

    +

    Selected edge style

    +

    Common vertex style

    +

    Selected vertex style

    + + +

    Find all paths

    +

    Number of paths from

    +

    to

    +

    is

    +

    Path #

    +

    Select finish vertex

    +

    Select start vertex

    + +

    Find all shortest paths from vertex

    +

    Distance from

    +

    Path to

    +

    Use context menu for additional actions.

    + +