對於來自兩個不同集合的項目的一對一分配,UI/UX 模式及其優缺點是什麼? (What are UI/UX patterns and their pros/cons for 1-to-1 assignments of items from two different sets?)


問題描述

對於來自兩個不同集合的項目的一對一分配,UI/UX 模式及其優缺點是什麼? (What are UI/UX patterns and their pros/cons for 1‑to‑1 assignments of items from two different sets?)

想想兩組不同的“二分”項目:車輛和司機。用戶必須在這些項目之間進行一對一的分配,如下所示:

  • 每輛車可以分配給 0 或 1 個司機。
  • 可以為每個司機分配到 0 或 1 輛車。

什麼是合適的 UI/UX 模式?

我已經考慮過提供三個“拖放”列表:(1)未分配的車輛,(2)未分配的駕駛員,以及(3)車輛和駕駛員的一對一分配。但我不確定創建新任務、翻轉兩個任務的車輛/駕駛員、管理大量項目等的“最舒適”的工作流程/操作,以及盡可能少的點擊/操作。


參考解法

方法 1:

Important Gotchas

  1. When you're managing multi‑list selection you need to be very specific about context ‑ is this going to be on a narrow screen such as a phone or portrait tablet? Narrow screens are often poor for side‑by‑side lists.

  2. This sounds like quite an industrial application ‑ is it done in a setting where people are standing or walking and may be jostled? Drag‑n‑drop can lose things half‑way.

One idiom is a copy‑paste variant where tapping an item in one list selects it and you either can tap another item, or some other cancel zone or tapping in the second list pastes the connection.

If the lists are long, offer an option to show only the free items so you can focus on those left to be assigned. That can be a simple toggle, maybe three‑way between All/Free/Set.

(by FlinschAndy Dent)

參考文件

  1. What are UI/UX patterns and their pros/cons for 1‑to‑1 assignments of items from two different sets? (CC BY‑SA 2.5/3.0/4.0)

#bipartite #assign #user-interface #set #user-experience






相關問題

如何找到圖的非完美二分匹配? (How can I find a non-perfect bipartite matching of a graph?)

如何使用 BFS 在無向二部圖中找到最短循環? (How can I find the shortest cycle in an undirected bipartite graph using BFS ?)

如何在有向圖中測試二分 (how to test for bipartite in directed graph)

檢查圖形是否是二分的 (check if the graph is bipartite or not)

二分圖中邊緣不同路徑的數量 (Number of edge distinct paths in bipartite graph)

對於來自兩個不同集合的項目的一對一分配,UI/UX 模式及其優缺點是什麼? (What are UI/UX patterns and their pros/cons for 1-to-1 assignments of items from two different sets?)

將多個函數應用於矩陣列表以返回數據框 (Apply multiple functions to list of matrices to return data frame)

如何將二分圖轉換為無二分圖 (How to convert a bipartite graph into no bipartite)

如何根據來自雙模網絡的匹配創建單模網絡(鄰接矩陣) (How to create a one-mode network (adjacency matrix) based on matches from two-mode network)

igraph 到達模型中屬性類型為“FALSE”的節點 (igraph reaching a node whose type of attribute in the model is "FALSE")

二分網絡igraph中的頂點屬性 (Vertex attributes in bipartite network igraph)

使用循環從 r 中的前一個列表創建一個新列表 (using loop to create a new list from previous list in r)







留言討論