代码空间


摘要(Abstract)

智慧城市（英语：Smart City）起源于传媒领域，是指利用各种信息技术或创新概念，将城市的系统和服务打通、集成，以提升资源运用的效率，优化城市管理和服务，以及改善市民生活质量。 智慧城市是把新一代信息技术充分运用在城市中各行各业基于知识社会下一代创新（创新2.0）的城市信息化高级形态，实现信息化、工业化与城镇化深度融合，有助于缓解“大城市病”，提高城镇化质量，实现精细化和动态管理，并提升城市管理成效和改善市民生活质量。智慧城市经常与数字城市、感知城市、无线城市、智能城市、生态城市、低碳城市等区域发展概念相交叉， 甚至与电子政务、智能交通、智能电网等行业信息化概念发生混杂。智慧城市通过物联网基础设施、云计算基础设施、地理空间基础设施等新一代信息技术以及维基、社交网络、Fab Lab、Living Lab、综合集成法、网动全媒体融合通信终端等工具和方法的应用，实现全面透彻的感知、宽带泛在的互联、智能融合的应用以及以用户创新、开放创新、大众创新、协同创新为特征的可持续创新。


主题(Topic)
struct Smart City 智慧城市
visit-struct-library 天网安防 机器人 智慧农业 工业互联网 Smart home 无人机 Industrial internet Drone drone bee colony unmanned IOT Smart agriculture robot Skynet Security Smart Logistics 智慧能源 Smart energy 智慧物流 智能家居 无人驾驶 无人机蜂群 物联网
ready-api django-autocomplete-light webapp2 strong-typing variables activerecord forms observers fiware-wirecloud calendar asynchronous query-by-example jquery-validate smart-wizard jsonpath tastypie stdclass subset android-webview correlated-subquery django-smart-selects sqlite scalability django google-maps stringr openweathermap android-navigation-drawer linq query-optimization validation full-text-indexing xalan algorithm sql-like cron kendo-grid filab json-simple lodash sql geography sql-server struct json.net entity-framework-5 opentripplanner maxmind

visit brewery-visit visit-count visit-counter visit-hotels visit-staff visit-visualization visit-wiki android-struct api-struct c-struct canvas-struct cloud-struct data-struct devops-struct dry-struct flag-struct generate-struct go-struct golang-struct json-struct kaitai-struct mvp-struct pair-struct php-struct python-struct ruby-struct sdk-struct sort-struct struct-ajson struct-cjail struct-construction struct-cpp struct-generator struct-js struct-keypath struct-log struct-mapping struct-parse struct-permissions struct-pointers struct-tag struct-tagger struct-tags struct-termios struct-tm struct-walker swift-struct
项目(Project)
newbe36524/Newbe.ObjectVisitor visit-dav/visit yb172/json-unknown kaitai-io/kaitai_struct_formats 7starsea/shannon_message execjosh/structtag Benzinga/flagstruct dennisstritzke/httpheader garbageslam/visit_struct mehrdadrad/stags powerflyco/sts tamboto2000/mapper yinqiwen/kcfg chakradeb/env scylladb/go-reflectx naveen-negi/ghuguti pkgng/copit R32/flash.Memory RebirthLee/godeep slashmo/swift-w3c-trace-context keilerkonzept/visit saintedlama/git-visit Herlitzd/cartograf 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 svenfuchs/obj airplayx/gormat MOZGIII/go-jsontag enbyss/Tablefy victpork/binutils haskel/map-serializer 全部项目