摘要(Abstract)
“智慧物流”Intelligent Logistics System, ILS首次由IBM提出,2009年12月中国物流技术协会信息中心、华夏物联网、《物流技术与应用》编辑部联合提出概念。物流是在空间、时间变化中的商品等物质资料的动态状态。
“智慧物流”是指通过智能硬件、物联网、大数据等智慧化技术与手段,提高物流系统分析决策和智能执行的能力,提升整个物流系统的智能化、自动化水平。一、降低物流成本,提高企业利润
二、加速物流产业的发展,成为物流业的信息技术支撑
三、为企业生产、采购和销售系统的智能融合打基础
四、使消费者节约成本,轻松、放心购物
五、提高政府部门工作效率,助于政治体制改革
六、促进当地经济进一步发展,提升综合竞争力
智慧物流集多种服务功能于一体,体现了现代经济运作特点的需求,即强调信息流与物质流快速、高效、通畅地运转,从而降低社会成本,提高生产效率,整合社会资源。
主题(Topic)
项目(Project)
abhishtagatya/typeDef
bnbdr/typedef
shawnrushefsky/typedef
ALanchl/Typedef
arangde/typescript-react-contextmenu
itanex/typedef-jquery-illustration
kbinani/win_api_type_info
414owen/typedef-gen
screeny05/shopware-typedef
ryota-murakami/flow-typedef
SaqlainHaider-Typedef/Alpha-Academic-Portal
MatthijsKamstra/hxjsondef
Nv = VertexNum; Graph->Ne = 0; for(V = 0; V < Graph->Nv; V ++) { Graph->G[V].FirstEdge = NULL; } printf("输入边的个数:"); scanf("%d", &(Graph->Ne)); if(Graph->Ne) { for(i = 0; i < Graph->Ne; i ++) { scanf("%d %d", &E1, &E2); //插入边 PtrToAdjVNode NewNode; NewNode = (PtrToAdjVNode)malloc (sizeof(struct AdjVNode)); NewNode->AdjV = E2; NewNode->Next = Graph->G[E1].FirstEdge; Graph->G[E1].FirstEdge = NewNode; //无向图,所以还是插入边 NewNode = (PtrToAdjVNode)malloc (sizeof(struct AdjVNode)); NewNode->AdjV = E1; NewNode->Next = Graph->G[E2].FirstEdge; Graph->G[E2].FirstEdge = NewNode; } } return Graph; } void Visit( Vertex V ) { printf(" %d", V); } void BFS ( LGraph Graph, Vertex S, void (*Visit)(Vertex) ) { int queue[11]; //定义一个队列 int l = 0, r = 0; queue[r++] = S; Visit(S); Visited[S] = true; PtrToAdjVNode tmp; while(l != r) //队列不为空 { tmp = Graph->G[queue[l++]].FirstEdge; while(tmp) { Vertex pos = tmp->AdjV; if(!Visited[pos]) { Visit(pos); Visited[pos] = true; queue[r++] = pos; } tmp = tmp->Next; } } } int main() { LGraph G; Vertex S; G = CreateGraph(); scanf("%d", &S); printf("BFS from %d:", S); BFS(G, S, Visit); return 0; }" class="topic-tag topic-tag-link">
11.5
Cells[P].Info == Legitimate) printf("%d is at position %d.\n", Key, P); else printf("%d is not found. Position %d is returned.\n", Key, P); return 0; }" class="topic-tag topic-tag-link">
daomin-xsy/12.10
harshita-soni/csv-manipulation-and-c-fundamentals
onafy/Intern-test-task
Esieve/library
>num1>>num2; int mark[num1],point[num1],bpoint[num1]; //重要的辅助数组 for(int i=0;i>ming[i].a>>ming[i].b; twnum *tw,*uw,*gw; save *yw; tw=new twnum[num1]; uw=new twnum[num1]; yw=new save[num1]; gw=new twnum[num1]; for(int i=0;i>aa>>bb>>cc; d=locate(aa,ming,num1); e=locate(bb,ming,num1); tw[d].c[e].a=cc; tw[e].c[d].a=cc; point[d]++; point[e]++; bpoint[d]--; bpoint[e]--;} for(int i=0;i>aa; cout<<"终点简称";cin>>bb; cout<"; if(uu>1) {lc=lc+tw[lx1].c[lx2].a;lx1=lx2,lx2=c[uu];} } lc=lc+tw[lx2].c[b].a; cout<<"总路程:"<"<
An-elemental--road-search-program
#include "list.h" #include "subwayGlobalDef.h" #include "subwayMacro.h" #include "subwayCard.h" #include "subwayCardHistory.h" using namespace std; typedef struct { EN_CARD_TYPE enCard; unsigned int cardNo; bool usrFlag; unsigned int balance; TListHead list; SUBWAY_CARD_HIS_RECORD hisRecord; }ST_SUBWAY_CARD; ST_SUBWAY_CARD g_cardList[MAX_CARD_NUM]; TListHead g_idleCardList; TListHead g_usredCardList; //乘车卡名称 char g_cardType[EN_CARD_TYPE_BUTT + 1][16] = { "单程卡", "老年卡", "普通卡", "未知卡类型" }; /* @ 初始化卡信息 @ 返回值: 无 */ void InitCardInfo(unsigned int cardNo) { IF_INVALID_RETURN_NOVALUE(cardNo < MAX_CARD_NUM) g_cardList[cardNo].enCard = EN_CARD_TYPE_BUTT; g_cardList[cardNo].cardNo = cardNo; g_cardList[cardNo].usrFlag = false; g_cardList[cardNo].balance = 0; g_cardList[cardNo].list.next = NULL; g_cardList[cardNo].list.prev = NULL; InitSubwayCardHisRecord(&(g_cardList[cardNo].hisRecord)); } /* @ 初始化所有卡信息 @ 返回值: 无 */ void InitCardManagerInfo() { InitListHead(&g_idleCardList); InitListHead(&g_usredCardList); for(unsigned int i = 0; i < MAX_CARD_NUM; i++) { InitCardInfo(i); ListAddTail(&(g_cardList[i].list), &g_idleCardList); } InitCardHistoryPool(); } /* @ 开卡,分配卡号和卡信息 @ 入参:enCard,卡类型; charge: 充值 @ 出参: cardNo, 分配的卡号 @ 返回值: EN_RETURN_SUCC,分配成功; EN_RETURN_CARD_OVERLOW, 分配失败; */ EN_RETURN_CODE AssignCard(unsigned int &cardNo, EN_CARD_TYPE enCard, unsigned int charge) { if(ListEmpty(&g_idleCardList)) { return EN_RETURN_CARD_OVERLOW; } IF_INVALID_RETURN(charge <= MAX_BALANCE, EN_RETURN_RECHARGE_OVERFLOW) TListHead* pNode = g_idleCardList.next; ST_SUBWAY_CARD* pCard = /*lint --e(413)*/CONTAINER_OF(pNode, ST_SUBWAY_CARD, list);/*lint --e(831)*/ //从空闲队列中删除, 并加到使用队列中 ListDel(pNode); ListAddTail(pNode, &g_usredCardList); pCard->usrFlag = true; pCard->enCard = enCard; pCard->balance = charge; cardNo = pCard->cardNo; return EN_RETURN_SUCC; } /* @ 充值 @ 入参:cardNo,卡号; recharge: 充值 @ 出参: 无 @ 返回值: EN_RETURN_SUCC,成功; 其他, 失败; */ EN_RETURN_CODE RechargeCard(unsigned int cardNo, unsigned int recharge) { IF_INVALID_RETURN(cardNo < MAX_CARD_NUM, EN_RETURN_INVALID_CARD) IF_INVALID_RETURN(g_cardList[cardNo].usrFlag, EN_RETURN_INVALID_CARD) IF_INVALID_RETURN(g_cardList[cardNo].enCard != EN_CARD_TYPE_SINGLE, EN_RETURN_SINGLE_CARD_CANNOT_RECHARGE) IF_INVALID_RETURN(g_cardList[cardNo].enCard != EN_CARD_TYPE_SINGLE, EN_RETURN_SINGLE_CARD_CANNOT_RECHARGE) IF_INVALID_RETURN((g_cardList[cardNo].balance + recharge) <= MAX_BALANCE, EN_RETURN_RECHARGE_OVERFLOW) g_cardList[cardNo].balance += recharge; return EN_RETURN_SUCC; } /* @ 获取卡余额 @ 入参:cardNo,卡号; @ 出参: balance: 余额 enCard: 卡类型 @ 返回值: EN_RETURN_SUCC,成功; EN_RETURN_INVALID_CARD, 失败; */ EN_RETURN_CODE GetCardInfo(unsigned int cardNo, unsigned int &balance, EN_CARD_TYPE &enCard) { IF_INVALID_RETURN(cardNo < MAX_CARD_NUM, EN_RETURN_INVALID_CARD) IF_INVALID_RETURN(g_cardList[cardNo].usrFlag, EN_RETURN_INVALID_CARD) balance = g_cardList[cardNo].balance; enCard = g_cardList[cardNo].enCard; return EN_RETURN_SUCC; } /* @ 卡扣费 @ 入参:cardNo,卡号; enCard, 卡类型; deductPrice, 扣费票价 @ 出参: balance, 扣费后的余额 @ 返回值: EN_RETURN_SUCC,成功; EN_RETURN_INVALID_CARD, EN_RETURN_BALANCE_NOT_ENOUGH, 失败; */ EN_RETURN_CODE DeductCard(unsigned int cardNo, EN_CARD_TYPE enCard, unsigned int deductPrice, unsigned int &balance) { IF_INVALID_RETURN(cardNo < MAX_CARD_NUM, EN_RETURN_INVALID_CARD) IF_INVALID_RETURN(g_cardList[cardNo].usrFlag, EN_RETURN_INVALID_CARD) balance = g_cardList[cardNo].balance; //余额不足 IF_INVALID_RETURN(deductPrice <= balance, EN_RETURN_BALANCE_NOT_ENOUGH) //扣费 g_cardList[cardNo].balance -= deductPrice; balance = g_cardList[cardNo].balance; //单程卡要注销Card if(EN_CARD_TYPE_SINGLE == enCard) { (void)DeleteCard(cardNo); } //余额过低 IF_INVALID_RETURN((EN_CARD_TYPE_SINGLE == enCard) || (balance >= 20), EN_RETURN_BALANCE_TOO_LOW) return EN_RETURN_SUCC; } void RecordCardHis(unsigned int cardNo, ST_SUBWAY_TIME& enterTime, ST_SUBWAY_TIME& exitTime, char* enterStation, char* exitStation, unsigned int ulExpenditure) { IF_INVALID_RETURN_NOVALUE(cardNo < MAX_CARD_NUM) IF_INVALID_RETURN_NOVALUE(g_cardList[cardNo].usrFlag) if(EN_RETURN_SUCC != AddSubwayCardHisRecord(&(g_cardList[cardNo].hisRecord), enterTime, exitTime, enterStation, exitStation, ulExpenditure)) { cout<<"RecordCardHis::AddSubwayCardHisRecord return fail!"; } } void QuerySubwayCardHis(unsigned int cardNo, string& outStr) { IF_INVALID_RETURN_NOVALUE(cardNo < MAX_CARD_NUM) IF_INVALID_RETURN_NOVALUE(g_cardList[cardNo].usrFlag) QuerySubwayCardHisRecord(&(g_cardList[cardNo].hisRecord), outStr); } /* @ 删除卡信息 @ 入参:cardNo,卡号; @ 出参: 无 @ 返回值: 0,成功; -1, 失败; */ int DeleteCard(unsigned int cardNo) { IF_INVALID_RETURN(cardNo < MAX_CARD_NUM, -1) IF_INVALID_RETURN(g_cardList[cardNo].usrFlag, -1) //从使用队列中删除, 并加到空闲队列中 TListHead* pNode = &(g_cardList[cardNo].list); ListDel(pNode); ListAddTail(pNode, &g_idleCardList); InitCardInfo(cardNo); return 0; } /* @ 获取卡类型字符串 @ 入参:enCard,卡类型; @ 出参: 无 @ 返回值: 卡类型字符串; */ char* GetCardTypeStr(EN_CARD_TYPE enCard) { return g_cardType[enCard]; } /* @ 根据卡类型字符串, 识别卡类型 @ 入参:cardType, 卡类型字符串; @ 出参: enCard, 卡类型 @ 返回值: EN_RETURN_SUCC,成功; EN_RETURN_INPUT_INVALID_CARDTYPE, 失败; */ EN_RETURN_CODE GetCardType(char cardType[], EN_CARD_TYPE &enCard) { string str = cardType; /* 目前仅支持普通卡 */ if((0 == str.compare("C")) || (0 == str.compare("c"))) { enCard = EN_CARD_TYPE_NOMAL; } else if((0 == str.compare("B")) || (0 == str.compare("b"))) { enCard = EN_CARD_TYPE_ELDER; } else { return EN_RETURN_INPUT_INVALID_CARDTYPE; } return EN_RETURN_SUCC; }" class="topic-tag topic-tag-link">
awfeequdng/SubWayCard.CPP