Function sortEdgesByAssignment

  • sortEdgesByAssignment(graph): {
        B?: number[];
        C?: number[];
        F?: number[];
        J?: number[];
        M?: number[];
        U?: number[];
        V?: number[];
    }

  • Parameters

    • graph: FOLD

      a FOLD object

    Returns {
        B?: number[];
        C?: number[];
        F?: number[];
        J?: number[];
        M?: number[];
        U?: number[];
        V?: number[];
    }

    keys: assignment characters, values: array of edge indices

    • Optional B?: number[]
    • Optional C?: number[]
    • Optional F?: number[]
    • Optional J?: number[]
    • Optional M?: number[]
    • Optional U?: number[]
    • Optional V?: number[]

    Description

    This method sorts edges by their assignment. Given a graph with edges_vertices, return a dictionary with all assignments as keys, and the values are an array of edge indices from this graph matching those assignments under the key.

Settings

Member Visibility

Theme