https://github.com/samcorcos/network-x
https://github.com/samcorcos/network-x
Last synced: 19 days ago
JSON representation
- Host: GitHub
- URL: https://github.com/samcorcos/network-x
- Owner: samcorcos
- Created: 2015-06-11T16:19:40.000Z (almost 11 years ago)
- Default Branch: master
- Last Pushed: 2015-08-18T07:46:53.000Z (almost 11 years ago)
- Last Synced: 2025-10-10T19:19:54.530Z (8 months ago)
- Language: CoffeeScript
- Size: 284 KB
- Stars: 3
- Watchers: 3
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# To Do
- [x] bootstrap some fake data into neo4j
- [ ] figure out the best way to add crimes to database (as a node, or as a property on an edge?)
- [x] ability to add data
- [x] with labels
- [ ] ability to add labels after-the-fact
- [ ] search
- [ ] needs special filter for Jurisdiction
- [x] tags
- [x] get rid of hardcoded tags
- [x] filter by tags
- [x] tags need to be inclusive, not exclusive—but only in certain circumstances
- [x] searches with a name query should be exclusive
- [x] searches without a name query should be inclusive
- [x] names
- [x] types
- [ ] custom/advanced queries
- [ ] clustering? interesting algorithms?
- [ ] shortest path between two nodes
- [ ] largest clique
- [ ] results
- [ ] limit results and show warning
- [ ] ...allow someone to display all data requested if they want to
- [x] d3 graph
- [ ] click to show details
- [ ] click on a button to fetch more from that node and add to the graph or remove node from graph
- [ ] display link type on graph
- [ ] get data to update responsively (rather than the current hack)
- [ ] implement zoom and pan
- [ ] resize nodes based on sqrt of incoming connections and weight of those connections
figure out "expand-by-one" option on click
shortest path between two nodes?
get more data into nodes (description) for popover display
#TODO June 20th
1. Special filter for Jurisdiction (exclusive filter)
2. Change the "create links" and "create nodes" to be global within the scope of D3
1. Then, create new functions that manipulate these arrays rather than destroy them and create new ones
Doing this will solve: 1) The D3 update problem, 2) The tags problem, 3) The reusability of methods with inputs