Description
Return crossesPartitions for opposite-side endpoints and endpointsKnown independently, inside result.
Local graph quantities describe a vertex, an edge, or a small neighborhood. Their algebra often assumes a simple undirected graph; using the same expression for loops, multigraphs, or directed data can change its meaning.
Return crossesPartitions for opposite-side endpoints and endpointsKnown independently, inside result.
When to use this tool
Use Graph: Bipartite Edge Partition Pair Check when you need a local graph quantity from explicitly supplied neighborhoods or counts.
How to use the tool and how it works
- Enter leftPartition, rightPartition, from, to. Keep parallel arrays aligned. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read result. Expand result to inspect the returned fields.
Require unique IDs across disjoint left and right partitions. Return crossesPartitions for opposite-side endpoints and endpointsKnown independently, inside result.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| leftPartition | Left Partition | Required. Array of text. Implementation limit: 128 items. |
| rightPartition | Right Partition | Required. Array of text. Implementation limit: 128 items. |
| from | From | Required. Text. Implementation limit: 8192 Unicode code points and 16384 UTF-16 code units. |
| to | To | Required. Text. Implementation limit: 8192 Unicode code points and 16384 UTF-16 code units. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| result | Object containing the calculated members; expand to inspect the fields below. | Required. Object. |
| result.crossesPartitions | Crosses Partitions | Calculated result member: boolean. |
| result.endpointsKnown | Endpoints Known | Calculated result member: boolean. |
{
"input": {
"leftPartition": [
"a",
"b"
],
"rightPartition": [
"c"
],
"from": "a",
"to": "c"
},
"output": {
"result": {
"crossesPartitions": true,
"endpointsKnown": true
}
}
}Limitations and assumptions
- Unknown endpoints produce false flags rather than an error; this checks one supplied pair without validating a complete graph as bipartite or selecting its partitions.
- Outputs are nested inside result. Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.
Alternative or Complementary methods
Inspect the actual graph or run a full traversal when the claim depends on global structure. Match the algorithm's graph model to direction, loops, multiplicity, and connectivity requirements.
References
Similar or alternative tools
- Bipartite Projection Shared Neighbor Pair
Deduplicate both supplied neighbor lists and return their literal intersection in first-list order and its count.
- Graph Degree Sequence Single Node Budget
Return nodes-1-degree as remainingNeighbors and feasible when degree is below nodes.